Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Galaxy cutsets in graphs

From MaRDI portal
Publication:975761
Jump to:navigation, search

DOI10.1007/s10878-009-9258-1zbMath1208.05065OpenAlexW2000364035MaRDI QIDQ975761

Adrian Vetta, Nicolas Sonnerat

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)


Related Items (1)

Defending Planar Graphs against Star-Cutsets



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Neighbour-connectivity in regular graphs
  • Star-cutsets and perfect graphs
  • PRIMES is in P
  • The firefighter problem for graphs of maximum degree three


This page was built for publication: Galaxy cutsets in graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:975761&oldid=12956704"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 20:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki