On the connectivity preserving minimum cut problem

DOI10.1016/j.jcss.2014.01.003zbMath1285.68121arXiv1309.6689OpenAlexW2084950686MaRDI QIDQ2637652

Jinhui Xu, Qi Duan

Publication date: 13 February 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6689

zbMATH Keywords

minimum cutinapproximabilityconnectivity preserving

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)

Cites Work

• A note on two problems in connexion with graphs
• On shortest disjoint paths in planar graphs
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
• The Complexity of Multiterminal Cuts
• On the hardness of approximating minimization problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the connectivity preserving minimum cut problem