Cops and robber game without recharging

DOI10.1007/s00224-011-9360-5zbMath1262.91037DBLPjournals/mst/FominGL12OpenAlexW2046320674WikidataQ60488466 ScholiaQ60488466MaRDI QIDQ692888

Fedor V. Fomin, Daniel Lokshtanov, Petr A. Golovach

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9360-5

zbMATH Keywords

complexitycops and robbers gamespursuit-evasion games on graphs

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (4)

To satisfy impatient web surfers is hard ⋮ Spy-game on graphs: complexity and simple topologies ⋮ Linguistic geometry approach for solving the cops and robber problem in grid environments ⋮ Chasing a drunk robber in many classes of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of pursuit on a graph
• A game of cops and robbers
• An annotated bibliography on guaranteed graph searching
• Some results about pursuit games on metric spaces obtained through graph theory techniques
• Vertex-to-vertex pursuit in a graph
• Pursuing a fast robber on a graph
• The Searchlight Scheduling Problem
• Cops and Robber Game without Recharging
• The complexity of searching a graph
• Solution of David Gale's lion and man problem

This page was built for publication: Cops and robber game without recharging