Randomized Pursuit-Evasion in Graphs

Abstract

We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node… (More)
DOI: 10.1007/3-540-45465-9_77

Topics

3 Figures and Tables

Statistics

051015'03'05'07'09'11'13'15'17
Citations per Year

98 Citations

Semantic Scholar estimates that this publication has 98 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Adler2002RandomizedPI, title={Randomized Pursuit-Evasion in Graphs}, author={Micah Adler and Harald R{\"a}cke and Naveen Sivadasan and Christian Sohler and Berthold V{\"{o}cking}, booktitle={ICALP}, year={2002} }