Two-agent tree evacuation
From MaRDI portal
Publication:2117727
DOI10.1007/978-3-030-79527-6_12OpenAlexW3176827935MaRDI QIDQ2117727
Robin Fritsch, Henri Devillez, Roger Wattenhofer, Béni Egressy
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79527-6_12
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (1)
Cites Work
- Unnamed Item
- How many ants does it take to find the food?
- Gathering few fat mobile robots in the plane
- Vertex-to-vertex pursuit in a graph
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Online graph exploration: New results on old and new algorithms
- Evacuating two robots from a disk: a second cut
- Deterministic rendezvous in graphs
- On the linear search problem
- Graph exploration by a finite automaton
- Distributed Evacuation in Graphs with Multiple Exits
- Collaborative search on the plane without communication
- Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
- Minimax Solutions for Linear Search Problems
- The Rendezvous Search Problem
- Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
- Reducibility among Combinatorial Problems
- Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
- Collaboration Without Communication: Evacuating Two Robots from a Disk
- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
- Wireless evacuation on \(m\) rays with \(k\) searchers
This page was built for publication: Two-agent tree evacuation
