Augmenting undirected node-connectivity by one
From MaRDI portal
Publication:2875183
DOI10.1145/1806689.1806767zbMath1293.05197OpenAlexW1992485864MaRDI QIDQ2875183
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806767
Related Items
Tri-connectivity augmentation in trees, An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach, Approximating node-connectivity augmentation problems, Augmenting the edge connectivity of planar straight line graphs to three, Connectivity augmentation in planar straight line graphs