Cops and robber with constraints
DOI10.1137/110837759zbMATH Open1248.05120DBLPjournals/siamdm/FominGP12OpenAlexW2064571607WikidataQ60488471 ScholiaQ60488471MaRDI QIDQ2910936FDOQ2910936
Authors: Fedor V. Fomin, Petr A. Golovach, Paweł Prałat 
Publication date: 12 September 2012
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110837759
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57) Positional games (pursuit and evasion, etc.) (91A24)
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spy-game on graphs: complexity and simple topologies
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- Some remarks on cops and drunk robbers
- Cops and robbers is EXPTIME-complete
- Parameterized pursuit-evasion games
- Cops and robber game without recharging
- Title not available (Why is that?)
- COPS OR ROBBERS — A BISTABLE SOCIETY
- Spy game: FPT-algorithm, hardness and graph products
- Spy game: FPT-algorithm and results on graph products
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- Bounds for cops and robber pursuit
- Cops and Robber game without recharging
- Fully active cops and robbers
This page was built for publication: Cops and robber with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910936)
