Vertex Pursuit Games in Stochastic Network Models

DOI10.1007/978-3-540-77294-1_6zbMATH Open1136.90319OpenAlexW1593533346MaRDI QIDQ5458505FDOQ5458505

Authors: Anthony Bonato, Paweł Prałat, Changping Wang 

Publication date: 15 April 2008

Published in: Combinatorial and Algorithmic Aspects of Networking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77294-1_6

Recommendations

• When does a random graph have constant cop number?
• Pursuit-evasion in models of complex networks
• Chasing robbers on random graphs: zigzag theorem
• Cops and robbers in a random graph
• Chasing robbers on percolated random geometric graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• Title not available (Why is that?)
• Vertex-to-vertex pursuit in a graph
• Random graphs.
• The Average Distance in a Random Graph with Given Expected Degrees
• Complex graphs and networks
• A game of cops and robbers
• On the domination number of a random graph
• Searching and sweeping graphs: a brief survey
• The cop density of a graph
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs

Cited In (5)

• A new approach to Gal's theory of search games on weakly Eulerian networks
• Meyniel extremal families of abelian Cayley graphs
• Vertex-pursuit in random directed acyclic graphs
• Pursuit-evasion in models of complex networks
• Hitting a path: a generalization of weighted connectivity via game theory

This page was built for publication: Vertex Pursuit Games in Stochastic Network Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458505)