Computing Vertex Connectivity: New Bounds from Old Techniques
From MaRDI portal
Publication:4943077
DOI10.1006/jagm.1999.1055zbMath0951.68108MaRDI QIDQ4943077
Harold N. Gabow, Satish B. Rao, Monika R. Henzinger
Publication date: 22 June 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/99361/files/HenzingerRG00.pdf
68R10: Graph theory (including graph drawing) in computer science
Related Items
Graph connectivity and its augmentation: Applications of MA orderings, Some recent progress and applications in graph minor theory, On shredders and vertex connectivity augmentation, Graph connectivity, partial words, and a theorem of Fine and Wilf, Minimum cost source location problem with vertex-connectivity requirements in digraphs, Construction for bicritical graphs and \(k\)-extendable bipartite graphs