Pursuit and Evasion from a Distance: Algorithms and Bounds

@inproceedings{Bonato2009PursuitAE,
  title={Pursuit and Evasion from a Distance: Algorithms and Bounds},
  author={Anthony Bonato and Ehsan Chiniforooshan},
  booktitle={ANALCO},
  year={2009}
}
Cops and Robber is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robber, distance k Cops and Robber, where the cops win if they are distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops needed to capture the robber in G. The distance k analogue… CONTINUE READING