A unifying augmentation algorithm for two-edge connectivity and biconnectivity

DOI10.1023/A:1009746026508zbMath0916.90260OpenAlexW1557279132MaRDI QIDQ1282207

Ming-Yang Kao, Tsan-sheng Hsu

Publication date: 21 July 1999

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009746026508

zbMATH Keywords

linear time algorithmundirected graphbiconnectivitybi-level augmentation problemtwo-edge connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (3)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ A dichotomy result for cyclic-order traversing games

This page was built for publication: A unifying augmentation algorithm for two-edge connectivity and biconnectivity