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):
Displayed 11 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)
- Multi-round cooperative search games with multiple players (Q2186824) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics (Q3132937) (← links)
- (Q5002857) (← links)
- (Q5092351) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)
- Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next (Q6202217) (← links)