Pages that link to "Item:Q5215469"
From MaRDI portal
The following pages link to Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (Q5215469):
Displaying 8 items.
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- Pebble guided optimal treasure hunt in anonymous graphs (Q2672573) (← links)
- State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
