Pages that link to "Item:Q2007918"
From MaRDI portal
The following pages link to Searching for an evader in an unknown graph by an optimal number of searchers (Q2007918):
Displaying 10 items.
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- Graph searching with advice (Q1008727) (← links)
- Efficiently searching a graph by a smell-oriented vertex process (Q1286410) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- The cost of monotonicity in distributed graph searching (Q2377133) (← links)
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem (Q5387746) (← links)
- On-line search in two-dimensional environment (Q5919296) (← links)