Pursuit-evasion in models of complex networks
DOI10.1080/15427951.2007.10129149zbMATH Open1206.68030OpenAlexW2055205054MaRDI QIDQ3078593FDOQ3078593
Authors: Anthony Bonato, Paweł Prałat, Changping Wang 
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
Recommendations
Applications of game theory (91A80) Games involving graphs (91A43) Network design and communication in computer systems (68M10) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)
Cited In (21)
- Vertex Pursuit Games in Stochastic Network Models
- To catch a falling robber
- Containment game played on random graphs: another zig-zag theorem
- Meyniel extremal families of abelian Cayley graphs
- Almost all cop-win graphs contain a universal vertex
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\)
- On a pursuit-evasion model without instantaneous movement
- Cops and Robbers on Dynamic Graphs: Offline and Online Case
- Vertex-pursuit in random directed acyclic graphs
- Chasing robbers on random graphs: zigzag theorem
- Cops and invisible robbers: the cost of drunkenness
- Some remarks on cops and drunk robbers
- Chasing robbers on random geometric graphs-an alternative approach
- Chasing a fast robber on planar graphs and random graphs
- Meyniel's conjecture holds for random graphs
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- The game of overprescribed Cops and Robbers played on graphs
- Cops and robbers from a distance
- Cops and robbers on geometric graphs
- On a characterization of evasion strategies for pursuit-evasion games on graphs
- The role of quantum correlations in cop and robber game
This page was built for publication: Pursuit-evasion in models of complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078593)
