On the minimum local-vertex-connectivity augmentation in graphs
From MaRDI portal
Publication:1406041
DOI10.1016/S0166-218X(02)00580-2zbMath1032.05128OpenAlexW2066003695MaRDI QIDQ1406041
Toshimasa Ishii, Hiroshi Nagamochi
Publication date: 9 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00580-2
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (2)
Tight approximation algorithm for connectivity augmentation problems ⋮ Local edge-connectivity augmentation in hypergraphs is NP-complete
Cites Work
- An approximation algorithm for minimum-cost vertex-connectivity problems
- Graph connectivity and its augmentation: Applications of MA orderings
- Parallel concepts in graph theory
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: On the minimum local-vertex-connectivity augmentation in graphs
