How to Guard a Graph?

DOI10.1007/978-3-540-92182-0_30MaRDI QIDQ3596729zbMATH OpenOpenAlexWikidataFDO

Authors Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matúš Mihalák, E. Vicari, Peter Widmayer

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_30

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• How to guard a graph?
• scientific article; zbMATH DE number 2188604
• How to guard a graph against tree moves
• How to survive while visiting a graph
• How to label a graph
• Edge protection in graphs
• How to eliminate a graph
• Guard games on graphs: keep the intruder out!

Cited in

(10)

• Cop-robber guarding game with cycle robber-region
• Guard games on graphs: keep the intruder out!
• How to guard a graph?
• Guard games on graphs: keep the intruder out!
• How to guard a graph against tree moves
• The guarding problem -- complexity and approximation
• Complexity of the cop and robber guarding game
• Cop-Robber Guarding Game with Cycle Robber Region
• Guarding a subgraph as a tool in pursuit-evasion games
• To satisfy impatient web surfers is hard

This page was built for publication: How to Guard a Graph?

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