Galaxy cutsets in graphs

DOI10.1007/S10878-009-9258-1MaRDI QIDQ975761zbMATH OpenOpenAlexFDO

Authors Nicolas Sonnerat, Adrian Vetta

Publication date 11 June 2010

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-009-9258-1

zbMATH Keywords

network connectivitydenial of service attacksgalaxy cutsets

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Recommendations

• Defending planar graphs against star-cutsets
• The vertex \(k\)-cut problem
• On spanning galaxies in digraphs
• On stable cutsets in graphs
• Cut-threshold graphs

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• Neighbour-connectivity in regular graphs
• PRIMES is in P
• Star-cutsets and perfect graphs
• The firefighter problem for graphs of maximum degree three
• The strong perfect graph theorem

Cited in

(1)

• Defending planar graphs against star-cutsets

This page was built for publication: Galaxy cutsets in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975761)