Pages that link to "Item:Q4471150"
From MaRDI portal
The following pages link to Randomized Pursuit-Evasion in Graphs (Q4471150):
Displaying 17 items.
- Cop vs. gambler (Q267177) (← links)
- Safe navigation in adversarial environments (Q723641) (← links)
- A property of random walks on a cycle graph (Q740121) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- A framework for pursuit evasion games in (Q1044718) (← links)
- The lion and man game on polyhedral surfaces with obstacles (Q1643158) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← links)
- Searching for an evader in an unknown graph by an optimal number of searchers (Q2007918) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- Locating a robber with multiple probes (Q2411615) (← links)
- Hunter, Cauchy rabbit, and optimal Kakeya sets (Q3190811) (← links)
- Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas (Q5111067) (← links)
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem (Q5387746) (← links)
- Control Sequencing in a Game of Identity Pursuit-Evasion (Q5501220) (← links)
- Equal-speed pursuit and evasion on manifolds (Q6146791) (← links)
