Pursuit-Evasion in Models of Complex Networks

DOI10.1080/15427951.2007.10129149zbMath1206.68030OpenAlexW2055205054MaRDI QIDQ3078593

Anthony Bonato, Changping Wang, Paweł Prałat

Publication date: 28 February 2011

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1243430813

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Applications of game theory (91A80) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)

Related Items (18)

To catch a falling robber ⋮ Cops and Robbers on Geometric Graphs ⋮ Cops and robbers from a distance ⋮ Chasing a Fast Robber on Planar Graphs and Random Graphs ⋮ The game of overprescribed Cops and Robbers played on graphs ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ Some remarks on cops and drunk robbers ⋮ Cops and Robbers on Dynamic Graphs: Offline and Online Case ⋮ On a characterization of evasion strategies for pursuit-evasion games on graphs ⋮ Almost all cop-win graphs contain a universal vertex ⋮ Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) ⋮ Chasing robbers on random graphs: Zigzag theorem ⋮ Meyniel's conjecture holds for random graphs ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Linguistic geometry approach for solving the cops and robber problem in grid environments ⋮ The role of quantum correlations in cop and robber game ⋮ Containment game played on random graphs: another zig-zag theorem ⋮ Meyniel extremal families of abelian Cayley graphs

This page was built for publication: Pursuit-Evasion in Models of Complex Networks