Pages that link to "Item:Q2251142"
From MaRDI portal
The following pages link to Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142):
Displaying 17 items.
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- Strategies for parallel unaware cleaners (Q896136) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Utility-based on-line exploration for repeated navigation in an embedded graph (Q1274283) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Multi-round cooperative search games with multiple players (Q2186824) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- Online graph exploration on trees, unicyclic graphs and cactus graphs (Q2656355) (← links)
- Online Graph Exploration: New Results on Old and New Algorithms (Q3012942) (← links)
- Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics (Q3132937) (← links)
- Brief announcement: Energy constrained depth first search (Q5002857) (← links)
- (Q5092351) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)
- An improved upper bound for the online graph exploration problem on unicyclic graphs (Q6621840) (← links)
- Energy constrained depth first search (Q6647777) (← links)