Complexity of the Cop and Robber Guarding Game

DOI10.1007/978-3-642-25011-8_29zbMath1344.05098OpenAlexW1888227659MaRDI QIDQ3111664

Robert Šámal, Rudolf Stolař, Tomáš Valla

Publication date: 13 January 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25011-8_29

zbMATH Keywords

computational complexitypursuit gameE-completenessgraph guarding gamecops and robber game

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

The guarding game is E-complete ⋮ Guarding a subgraph as a tool in pursuit-evasion games

This page was built for publication: Complexity of the Cop and Robber Guarding Game