An Experimental Study ofk-vertex Connectivity Algorithms
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/351 |
Resumo: | We present an algorithm for the k-vertex connectivity problem, which runs in O(km) time. The time complexity of the algorithm depends on the connectivity, k, and the edges number, m. The algorithm mainly performs Breadth first search (BFS) to findall the disjoint paths. The goal of this paper is to provide an experimental comparison of the efficiency of k-vertex algorithms. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. We study the state-of-artMax-Flow/Min-Cutalgorithms; ‘Dinic’, ‘Push-relabel’, and ‘Pseudoflow’. Experiments show that our algorithm performs well onk-vertex connectivity problem. |
id |
UFLA-5_9104deb2cd3ba9f08cc99bb47699ec9d |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/351 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
An Experimental Study ofk-vertex Connectivity AlgorithmsGraph algorithmsk-vertex connectivitymaximum flowminimum cutnetwork design problemreliability.We present an algorithm for the k-vertex connectivity problem, which runs in O(km) time. The time complexity of the algorithm depends on the connectivity, k, and the edges number, m. The algorithm mainly performs Breadth first search (BFS) to findall the disjoint paths. The goal of this paper is to provide an experimental comparison of the efficiency of k-vertex algorithms. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. We study the state-of-artMax-Flow/Min-Cutalgorithms; ‘Dinic’, ‘Push-relabel’, and ‘Pseudoflow’. Experiments show that our algorithm performs well onk-vertex connectivity problem.Editora da UFLA2012-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/351INFOCOMP Journal of Computer Science; Vol. 11 No. 2 (2012): June, 2012; 1-91982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/351/335Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessRigat, Azzeddine2015-07-29T12:33:53Zoai:infocomp.dcc.ufla.br:article/351Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:33.620447INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
An Experimental Study ofk-vertex Connectivity Algorithms |
title |
An Experimental Study ofk-vertex Connectivity Algorithms |
spellingShingle |
An Experimental Study ofk-vertex Connectivity Algorithms Rigat, Azzeddine Graph algorithms k-vertex connectivity maximum flow minimum cut network design problem reliability. |
title_short |
An Experimental Study ofk-vertex Connectivity Algorithms |
title_full |
An Experimental Study ofk-vertex Connectivity Algorithms |
title_fullStr |
An Experimental Study ofk-vertex Connectivity Algorithms |
title_full_unstemmed |
An Experimental Study ofk-vertex Connectivity Algorithms |
title_sort |
An Experimental Study ofk-vertex Connectivity Algorithms |
author |
Rigat, Azzeddine |
author_facet |
Rigat, Azzeddine |
author_role |
author |
dc.contributor.author.fl_str_mv |
Rigat, Azzeddine |
dc.subject.por.fl_str_mv |
Graph algorithms k-vertex connectivity maximum flow minimum cut network design problem reliability. |
topic |
Graph algorithms k-vertex connectivity maximum flow minimum cut network design problem reliability. |
description |
We present an algorithm for the k-vertex connectivity problem, which runs in O(km) time. The time complexity of the algorithm depends on the connectivity, k, and the edges number, m. The algorithm mainly performs Breadth first search (BFS) to findall the disjoint paths. The goal of this paper is to provide an experimental comparison of the efficiency of k-vertex algorithms. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. We study the state-of-artMax-Flow/Min-Cutalgorithms; ‘Dinic’, ‘Push-relabel’, and ‘Pseudoflow’. Experiments show that our algorithm performs well onk-vertex connectivity problem. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012-06-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/351 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/351 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/351/335 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 11 No. 2 (2012): June, 2012; 1-9 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874741399453696 |