A note on the vertex-connectivity augmentation problem
From MaRDI portal
Publication:1386437
DOI10.1006/jctb.1997.1786zbMath0940.05040OpenAlexW2028334693MaRDI QIDQ1386437
Publication date: 19 July 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/227035e20120f1ec2f377e2d4f80ce544631adeb
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (8)
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Property testing on \(k\)-vertex-connectivity of graphs ⋮ Approximating node-connectivity augmentation problems ⋮ On shredders and vertex connectivity augmentation ⋮ Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Independence free graphs and vertex connectivity augmentation ⋮ Extremal graphs in connectivity augmentation
Cites Work
This page was built for publication: A note on the vertex-connectivity augmentation problem
