Pages that link to "Item:Q1757761"
From MaRDI portal
The following pages link to Exploring sparse graphs with advice (extended abstract) (Q1757761):
Displaying 6 items.
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- An improved upper bound for the online graph exploration problem on unicyclic graphs (Q6621840) (← links)
