Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph

DOI10.1023/A:1009884922499zbMath0952.05040OpenAlexW1512076778MaRDI QIDQ1977862

Hiroshi Nagamochi, Toshimasa Ishii, Toshihide Ibaraki

Publication date: 14 January 2001

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

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

zbMATH Keywords

edge-connectivitygraph augmentationvertex-connectivitypolynomial deterministic algorithmundirected multigraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (2)

Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Graph connectivity and its augmentation: Applications of MA orderings

This page was built for publication: Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph