Cops and Robber Game without Recharging

DOI10.1007/978-3-642-13731-0_26zbMath1285.68054OpenAlexW1549486034WikidataQ60488604 ScholiaQ60488604MaRDI QIDQ3569897

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Spy game: FPT-algorithm, hardness and graph products ⋮ Spy game: FPT-algorithm and results on graph products ⋮ Cops and robber game without recharging

This page was built for publication: Cops and Robber Game without Recharging