### Citations

121 | A game of cops and robbers
- Aigner, Fromme
- 1984
(Show Context)
Citation Context ...be placed on, and then the ayers move their token along the edges of the graph, alternately starting with the cop. The cop wins if at some step of e game it occupies the same vertex as the robber. In =-=[1]-=-, the Cop Player is allowed to use a team of k 1 cops. One timization problem is then to decide the cop number of a graph G , i.e., the minimum number of cops that are required capture the robber in... |

102 | An annotated bibliography on guaranteed graph searching,
- Fomin, Thilikos
- 2008
(Show Context)
Citation Context ...ges at each step guarantees the Web surfer never waits (whatever the surfer does). . Our results We model the above prefetching problem as a two-player game similar to Cops and Robber game (e.g., see =-=[3,9,11,25,26]-=-). e first prove that “monotonicity does not help”, that is, if the fugitive follows only induced paths, the smallest k such at there is a winning k-strategy is equal to the surveillance number. We pr... |

32 |
On a pursuit game played on graphs for which a minor is excluded,
- Andreae
- 1986
(Show Context)
Citation Context ...minimum number of cops that are required capture the robber in G . It is known to be W[2]-hard in general [13,18]. Lower and upper bounds on the cop number of rious classes of graphs have been proved =-=[4,5,16,28]-=-. JID:TCS AID:9581 /FLA Doctopic: Algorithms, automata, complexity and games [m3G; v 1.123; Prn:28/01/2014; 11:09] P.3 (1-17) F.V. Fomin et al. / Theoretical Computer Science ••• (••••) •••–••• 3 ro v... |

18 | Cops and robbers in a random graph
- Bollobás, Kun, et al.
(Show Context)
Citation Context ...minimum number of cops that are required capture the robber in G . It is known to be W[2]-hard in general [13,18]. Lower and upper bounds on the cop number of rious classes of graphs have been proved =-=[4,5,16,28]-=-. JID:TCS AID:9581 /FLA Doctopic: Algorithms, automata, complexity and games [m3G; v 1.123; Prn:28/01/2014; 11:09] P.3 (1-17) F.V. Fomin et al. / Theoretical Computer Science ••• (••••) •••–••• 3 ro v... |

12 |
Searching and Sweeping Graphs: A Brief Survey, Le Matematiche 59
- Alspach
- 2004
(Show Context)
Citation Context ...ges at each step guarantees the Web surfer never waits (whatever the surfer does). . Our results We model the above prefetching problem as a two-player game similar to Cops and Robber game (e.g., see =-=[3,9,11,25,26]-=-). e first prove that “monotonicity does not help”, that is, if the fugitive follows only induced paths, the smallest k such at there is a winning k-strategy is equal to the surveillance number. We pr... |

9 | On a generalization of meyniel’s conjecture on the cops and robbers game. Research report
- Alon, Mehrabian
- 2010
(Show Context)
Citation Context ...wed to use a team of k 1 cops. One timization problem is then to decide the cop number of a graph G , i.e., the minimum number of cops that are required capture the robber in G . It is known to be W=-=[2]-=--hard in general [13,18]. Lower and upper bounds on the cop number of rious classes of graphs have been proved [4,5,16,28]. JID:TCS AID:9581 /FLA Doctopic: Algorithms, automata, complexity and games [... |

9 | Cop and robber games when the robber can hide and ride
- Chalopin, Chepoi, et al.
(Show Context)
Citation Context ...a ga in 2. al an N de N in a if gr 2. st w Th a th ob if, fu al ob th po th in fr kob of su W ob be m amSeveral variants have been studied such as when the cops and the robber have different speeds =-=[2,7,13,23]-=-, when the bber can be captured at some distance [6], when each cop can be moved a bounded number of times [15], etc. In the riant proposed in [12,14], the goal for the cops is to guard some part of a... |

5 |
Cops and robbers from a distance. Theor
- Bonato, Chiniforooshan, et al.
(Show Context)
Citation Context ...fu al ob th po th in fr kob of su W ob be m amSeveral variants have been studied such as when the cops and the robber have different speeds [2,7,13,23], when the bber can be captured at some distance =-=[6]-=-, when each cop can be moved a bounded number of times [15], etc. In the riant proposed in [12,14], the goal for the cops is to guard some part of a graph, i.e., to prevent the robber to reach some rt... |

5 | To satisfy impatient web surfers is hard
- Fomin, Giroire, et al.
- 2012
(Show Context)
Citation Context ...he visit of the first author at the team-project COATI, INRIA, I3S, Sophia Antipolis, France. A short version of this per has been presented in the 6th International Conference on FUN with Algorithms =-=[11]-=-. Corresponding author. 04-3975/$ – see front matter © 2014 Elsevier B.V. All rights reserved. tp://dx.doi.org/10.1016/j.tcs.2014.01.009 JID:TCS AID:9581 /FLA Doctopic: Algorithms, automata, complexit... |

1 |
Parameterized algorithm for eternal vertex
- Fomin, Gaspers, et al.
- 2010
(Show Context)
Citation Context ...eternal vertex cover can also be viewed as cops and robber mes, where the robber has no token but can attack a vertex (or an edge) at each step and the cop must move its tokens response to the attack =-=[10,19]-=-. Preliminaries In this section, we formally define the problems we consider and present the notations used throughout the paper. We so present some basic results. For any (di)graph G = (V , E) consid... |