On shredders and vertex connectivity augmentation

DOI10.1016/j.jda.2006.03.005zbMath1142.05330MaRDI QIDQ924546

Zeev Nutov, Gilad Liberman

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.005

zbMATH Keywords

approximation algorithms; exact algorithms; node-connectivity augmentation; shredders

Mathematics Subject Classification ID

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C40: Connectivity

Related Items

Tight approximation algorithm for connectivity augmentation problems, 5-shredders in 5-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a theorem of Mader
• A note on the vertex-connectivity augmentation problem
• On the optimal vertex-connectivity augmentation
• Minimal edge-coverings of pairs of sets
• On the Structure of Minimum-Weight k-Connected Spanning Networks
• k-shredders ink-connected graphs
• Finding the Vertex Connectivity of Graphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• A Reduction Method for Edge-Connectivity in Graphs
• On sparse subgraphs preserving connectivity properties
• Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
• Computing Vertex Connectivity: New Bounds from Old Techniques
• On rooted node-connectivity problems