Randomized Pursuit-Evasion in Graphs
From MaRDI portal
Recommendations
Cited in
(22)- A framework for pursuit evasion games in
- Hunting rabbits on the hypercube
- The lion and man game on polyhedral surfaces with obstacles
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- Searching for an evader in an unknown graph by an optimal number of searchers
- Zero-visibility cops and robber and the pathwidth of a graph
- Locating a robber with multiple probes
- Cop vs. gambler
- Hunter, Cauchy rabbit, and optimal Kakeya sets
- scientific article; zbMATH DE number 2086681 (Why is no real title available?)
- Smarter Lions: efficient cooperative pursuit in general bounded arenas
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
- Randomized Pursuit-Evasion with Local Visibility
- Control sequencing in a game of identity pursuit-evasion
- Randomized pursuit-evasion with limited visibility
- Equal-speed pursuit and evasion on manifolds
- An isoperimetric inequality and pursuit-evasion games on triangular grid graphs
- Safe navigation in adversarial environments
- A property of random walks on a cycle graph
- How to hunt an invisible rabbit on a graph
- The pebbling threshold of the square of cliques
- Escaping offline searchers and isoperimetric theorems
This page was built for publication: Randomized Pursuit-Evasion in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471150)
