Cop-robber guarding game with cycle robber-region

DOI10.1016/j.tcs.2010.04.014zbMath1237.91044OpenAlexW2153017110MaRDI QIDQ620952

Hiroshi Nagamochi

Publication date: 2 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.014

zbMATH Keywords

graph algorithmpursuit-evasion gamesNP-completepath coveringcop-robber game

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (4)

The guarding game is E-complete ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ How to guard a graph against tree moves ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs

Cites Work

• A game of cops and robbers
• Some results about pursuit games on metric spaces obtained through graph theory techniques
• Vertex-to-vertex pursuit in a graph
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• How to Guard a Graph?
• `` Strong NP-Completeness Results

This page was built for publication: Cop-robber guarding game with cycle robber-region