Pages that link to "Item:Q955225"
From MaRDI portal
The following pages link to Escaping offline searchers and isoperimetric theorems (Q955225):
Displaying 7 items.
- Improved bounds for cops-and-robber pursuit (Q634246) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- Bounds for cops and robber pursuit (Q991186) (← links)
- How many lions are needed to clear a grid? (Q1662492) (← links)
- Reversibility properties of the fire-fighting problem in graphs (Q1693325) (← links)
- Hunter, Cauchy rabbit, and optimal Kakeya sets (Q3190811) (← links)
- Geometric firefighting in the half-plane (Q5918101) (← links)
