The minimum vulnerability problem on graphs
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
- Finding paths with minimum shared edges
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1487883 (Why is no real title available?)
- Maintaining graph properties of weakly chordal graphs
- On network design problems: fixed cost flows and the covering Steiner problem
- The minimum vulnerability problem
Cited in
(7)- The minimum shared edges problem on grid-like graphs
- Hardness of minimum barrier shrinkage and minimum installation path
- Finding paths with minimum shared edges
- The minimum vulnerability problem on specific graph classes
- The minimum vulnerability problem
- The minimum vulnerability problem
- The parameterized complexity of the minimum shared edges problem
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)