Parameterized analysis of the cops and robber game
H Gahlawat, M Zehavi - 48th International Symposium on …, 2023 - drops.dagstuhl.de
Pursuit-evasion games have been intensively studied for several decades due to their
numerous applications in artificial intelligence, robot motion planning, database theory …
numerous applications in artificial intelligence, robot motion planning, database theory …
[PDF][PDF] Variations of cops and robber on the hypercube.
D Offner, K Ojakian - Australas. J Comb., 2014 - fsw01.bcc.cuny.edu
We determine the cop number of the hypercube for different versions of the game Cops and
Robber. Cops and Robber is a two player game played on an undirected graph. One player …
Robber. Cops and Robber is a two player game played on an undirected graph. One player …
Cops and Robbers on Planar‐Directed Graphs
PS Loh, S Oh - Journal of Graph Theory, 2017 - Wiley Online Library
Aigner and Fromme initiated the systematic study of the cop number of a graph by proving
the elegant and sharp result that in every connected planar graph, three cops are sufficient …
the elegant and sharp result that in every connected planar graph, three cops are sufficient …
Parameterized analysis of the cops and robber problem
H Gahlawat, M Zehavi - arXiv preprint arXiv:2307.04594, 2023 - arxiv.org
\textit {Pursuit-evasion games} have been intensively studied for several decades due to
their numerous applications in artificial intelligence, robot motion planning, database theory …
their numerous applications in artificial intelligence, robot motion planning, database theory …
[HTML][HTML] Cops and robbers on intersection graphs
The cop number of a graph G is the smallest k such that k cops win the game of cops and
robber on G. We investigate the maximum cop number of geometric intersection graphs …
robber on G. We investigate the maximum cop number of geometric intersection graphs …
On the Cop Number of String Graphs
S Das, H Gahlawat - 33rd International Symposium on …, 2022 - drops.dagstuhl.de
Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph,
where a group of cops tries to capture the robber. The cop number of a graph is the …
where a group of cops tries to capture the robber. The cop number of a graph is the …
Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor
P Bose, JL De Carufel, T Shermer - arXiv preprint arXiv:2204.11926, 2022 - arxiv.org
We study zombies and survivor, a variant of the game of cops and robber on graphs. In this
variant, the single survivor plays the role of the robber and attempts to escape from the …
variant, the single survivor plays the role of the robber and attempts to escape from the …
Cops and Robbers playing on edges
In the game of cops and robbers, the cops try to capture a robber moving on the vertices of
the graph. The minimum number of cops required to win on a given graph $ G $ is called the …
the graph. The minimum number of cops required to win on a given graph $ G $ is called the …
[HTML][HTML] Visibility graphs, dismantlability, and the cops and robbers game
A Lubiw, J Snoeyink, H Vosoughpour - Computational Geometry, 2017 - Elsevier
We study versions of cop and robber pursuit–evasion games on the visibility graphs of
polygons, and inside polygons with straight and curved sides. Each player has full …
polygons, and inside polygons with straight and curved sides. Each player has full …