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...
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 ...
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 ...
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...
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 ...