How to Guard a Graph?
DOI10.1007/978-3-540-92182-0_30zbMATH Open1183.91021OpenAlexW1505535472WikidataQ60488740 ScholiaQ60488740MaRDI QIDQ3596729FDOQ3596729
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cited In (10)
- Cop-robber guarding game with cycle robber-region
- Guard games on graphs: keep the intruder out!
- Guard games on graphs: keep the intruder out!
- How to guard a graph?
- 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)