Cop-Robber Guarding Game with Cycle Robber Region

DOI10.1007/978-3-642-02270-8_10zbMath1248.91018OpenAlexW2161996279MaRDI QIDQ5321698

Hiroshi Nagamochi

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items

Guard games on graphs: keep the intruder out! ⋮ How to guard a graph? ⋮ Guarding a subgraph as a tool in pursuit-evasion games

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?