Vertex Pursuit Games in Stochastic Network Models

DOI10.1007/978-3-540-77294-1_6zbMath1136.90319OpenAlexW1593533346MaRDI QIDQ5458505

Changping Wang, Paweł Prałat, Anthony Bonato

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

Mathematics Subject Classification ID

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

Related Items (1)

Meyniel extremal families of abelian Cayley graphs

Cites Work

• A game of cops and robbers
• Vertex-to-vertex pursuit in a graph
• The Average Distance in a Random Graph with Given Expected Degrees
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• On the domination number of a random graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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