Pages that link to "Item:Q1929219"
From MaRDI portal
The following pages link to Online graph exploration: New results on old and new algorithms (Q1929219):
Displaying 12 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- The simple grid polygon exploration problem (Q2025057) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Two-agent tree evacuation (Q2117727) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- Online graph exploration on trees, unicyclic graphs and cactus graphs (Q2656355) (← links)
- (Q5002857) (← links)
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS (Q5051225) (← links)
- The Power of Recourse for Online MST and TSP (Q5890825) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
