The minimum vulnerability problem on graphs
DOI10.1007/978-3-319-12691-3_23zbMATH Open1431.90160OpenAlexW399212607MaRDI QIDQ2942407FDOQ2942407
Authors: Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou 
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_23
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- On network design problems: fixed cost flows and the covering steiner problem
- Finding paths with minimum shared edges
- Title not available (Why is that?)
- The minimum vulnerability problem
- A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
- Maintaining graph properties of weakly chordal graphs
Cited In (7)
- The parameterized complexity of the minimum shared edges problem
- Hardness of minimum barrier shrinkage and minimum installation path
- The minimum vulnerability problem on specific graph classes
- The minimum vulnerability problem
- The minimum vulnerability problem
- The minimum shared edges problem on grid-like graphs
- Finding paths with minimum shared edges
This page was built for publication: The minimum vulnerability problem on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942407)
