On the connectivity preserving minimum cut problem
From MaRDI portal
Publication:2637652
DOI10.1016/j.jcss.2014.01.003zbMath1285.68121arXiv1309.6689MaRDI QIDQ2637652
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
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C40: Connectivity
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