13 search results - page 2 / 3 » Bounds for cops and robber pursuit |
TCS
2008
13 years 5 months ago
2008
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...
DAM
1999
13 years 5 months ago
1999
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
WG
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
TCS
2008
13 years 5 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...