Sciweavers

14 search results - page 1 / 3
» Visibility Graphs, Dismantlability, and the Cops and Robbers...
Sort
View
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 8 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
TCS
2008
13 years 10 months ago
The role of information in the cop-robber game
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 ...
Volkan Isler, Nikhil Karnad
IM
2007
13 years 10 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
DAM
1999
90views more  DAM 1999»
13 years 10 months ago
Note on a Helicopter Search Problem on Graphs
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...
Fedor V. Fomin
DM
2006
83views more  DM 2006»
13 years 10 months ago
A note on k-cop, l-robber games on graphs
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
Gena Hahn, Gary MacGillivray