A minimum 3-connectivity augmentation of a graph
From MaRDI portal
Publication:1208926
DOI10.1016/0022-0000(93)90050-7zbMath0768.68188MaRDI QIDQ1208926
Publication date: 16 May 1993
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(93)90050-7
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- Edge-connectivity augmentation problems
- A smallest augmentation to 3-connect a graph
- Approximation Algorithms for Several Graph Augmentation Problems
- Augmentation Problems
- Smallest Augmentations to Biconnect a Graph
- `` Strong NP-Completeness Results
- Dividing a Graph into Triconnected Components
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item