The Minimum Vulnerability Problem on Graphs

DOI10.1007/978-3-319-12691-3_23zbMath1431.90160OpenAlexW399212607MaRDI QIDQ2942407

Christian Konrad, Xiao Zhou, Yusuke Aoki, Magnús M. Halldórsson, Bjarni V. Halldórsson, Takehiro Ito

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The minimum vulnerability problem on specific graph classes

Cites Work

• Finding paths with minimum shared edges
• On network design problems: fixed cost flows and the covering steiner problem
• Graph Classes: A Survey
• The Minimum Vulnerability Problem
• A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Unnamed Item
• Unnamed Item
• Unnamed Item