Pages that link to "Item:Q343923"
From MaRDI portal
The following pages link to Lower and upper competitive bounds for online directed graph exploration (Q343923):
Displaying 6 items.
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- The simple grid polygon exploration problem (Q2025057) (← links)
- Dispersion of mobile robots on directed anonymous graphs (Q2097347) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
