Cops and robber game without recharging
DOI10.1007/S00224-011-9360-5zbMATH Open1262.91037DBLPjournals/mst/FominGL12OpenAlexW2046320674WikidataQ60488466 ScholiaQ60488466MaRDI QIDQ692888FDOQ692888
Authors: Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov 
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
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex-to-vertex pursuit in a graph
- A game of cops and robbers
- An annotated bibliography on guaranteed graph searching
- The complexity of searching a graph
- Pursuing a fast robber on a graph
- Searching and sweeping graphs: a brief survey
- Some results about pursuit games on metric spaces obtained through graph theory techniques
- The complexity of pursuit on a graph
- Title not available (Why is that?)
- Solution of David Gale's lion and man problem
- Cops and Robber game without recharging
- The Searchlight Scheduling Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (34)
- General cops and robbers games with randomness
- Cop-robber guarding game with cycle robber-region
- Chasing a drunk robber in many classes of graphs
- A game theoretic analysis of the cops and robber game
- To catch a falling robber
- Pursuing a fast robber on a graph
- Spy-game on graphs: complexity and simple topologies
- Cops, robbers, and burning bridges
- On the computational complexity of a game of cops and robbers
- Simultaneously moving cops and robbers
- Selfish cops and active robber: multi-player pursuit evasion on graphs
- On a game of policemen and robber
- Title not available (Why is that?)
- Some remarks on cops and drunk robbers
- Cops and robbers is EXPTIME-complete
- Parameterized pursuit-evasion games
- Cops and an insightful robber
- Cops, robber and traps
- The cops and robber game on graphs with forbidden (induced) subgraphs
- Cops and robber game on infinite chessboard
- Improved bounds for cops-and-robber pursuit
- Guarding a subgraph as a tool in pursuit-evasion games
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- Cops and robbers from a distance
- Police and robber game on infinite chessboard
- A survey on the relationship between the game of cops and robbers and other game representations
- Cops and Robber game without recharging
- Cops and Robbers on Dynamic Graphs: Offline and Online Case
- Title not available (Why is that?)
- Cops and robber with constraints
- To satisfy impatient web surfers is hard
- Cops and robbers on oriented graphs
- Fully active cops and robbers
- Selfish cops and passive robber: qualitative games
This page was built for publication: Cops and robber game without recharging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692888)
