Cops and Robber game without recharging
DOI10.1007/978-3-642-13731-0_26zbMATH Open1285.68054DBLPconf/swat/FominGL10OpenAlexW1549486034WikidataQ60488604 ScholiaQ60488604MaRDI QIDQ3569897FDOQ3569897
Authors: Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov 
Publication date: 22 June 2010
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-13731-0_26
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Positional games (pursuit and evasion, etc.) (91A24)
Cited In (20)
- Cop-robber guarding game with cycle robber-region
- To catch a falling robber
- Pursuing a fast robber on a graph
- The game of cops and eternal robbers
- 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
- Title not available (Why is that?)
- Cops and robbers is EXPTIME-complete
- Parameterized pursuit-evasion games
- Cops and an insightful robber
- Cops and robber game without recharging
- Spy game: FPT-algorithm, hardness and graph products
- Spy game: FPT-algorithm and results on graph products
- Guarding a subgraph as a tool in pursuit-evasion games
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- A survey on the relationship between the game of cops and robbers and other game representations
- Cops and robber with constraints
- Catching a fast robber on interval graphs
- Fully active cops and robbers
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 Q3569897)
