The minimum vulnerability problem on specific graph classes
DOI10.1007/S10878-015-9950-2zbMATH Open1356.90148OpenAlexW2178803989MaRDI QIDQ346526FDOQ346526
Authors: Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou 
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9950-2
Recommendations
- The minimum vulnerability problem on graphs
- The minimum vulnerability problem
- The minimum vulnerability problem
- scientific article; zbMATH DE number 1339493
- scientific article; zbMATH DE number 4053662
- Measuring the vulnerability for classes of intersection graphs
- Vulnerability of subclasses of chordal graphs
- On critical node problems with vulnerable vertices
- Vulnerability of some splitting graphs
- On computing the vulnerability of some graphs as average
graph algorithmchordal graphfixed parameter tractabilitybounded treewidth graphminimum vulnerability problem
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Efficient graph representations
- On network design problems: fixed cost flows and the covering steiner problem
- Beyond the flow decomposition barrier
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- The minimum vulnerability problem on graphs
- 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
Cited In (6)
This page was built for publication: The minimum vulnerability problem on specific graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346526)
