Augmenting undirected node-connectivity by one

DOI10.1145/1806689.1806767zbMath1293.05197OpenAlexW1992485864MaRDI QIDQ2875183

László A. Végh

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

zbMATH Keywords

connectivity augmentationnode-connectivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (5)

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

This page was built for publication: Augmenting undirected node-connectivity by one