Randomized Pursuit-Evasion in Graphs

DOI10.1017/S0963548303005625zbMath1114.91300OpenAlexW1978547141MaRDI QIDQ4471150

Berthold Vöcking, Harald Räcke, Christian Sohler, Naveen Sivadasan, Micah Adler

Publication date: 18 June 2004

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548303005625

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (16)

Cop vs. gambler ⋮ The lion and man game on polyhedral surfaces with obstacles ⋮ Hunter, Cauchy rabbit, and optimal Kakeya sets ⋮ Locating a robber with multiple probes ⋮ How to hunt an invisible rabbit on a graph ⋮ Equal-speed pursuit and evasion on manifolds ⋮ Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas ⋮ Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem ⋮ The pebbling threshold of the square of cliques ⋮ Escaping offline searchers and isoperimetric theorems ⋮ Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder ⋮ Safe navigation in adversarial environments ⋮ A property of random walks on a cycle graph ⋮ A framework for pursuit evasion games in ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Zero-visibility cops and robber and the pathwidth of a graph

This page was built for publication: Randomized Pursuit-Evasion in Graphs