Two-agent tree evacuation

DOI10.1007/978-3-030-79527-6_12OpenAlexW3176827935MaRDI QIDQ2117727FDOQ2117727

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Reducibility among Combinatorial Problems
• Vertex-to-vertex pursuit in a graph
• Online graph exploration: New results on old and new algorithms
• Deterministic rendezvous in graphs
• The Rendezvous Search Problem
• Graph exploration by a finite automaton
• Title not available (Why is that?)
• Gathering few fat mobile robots in the plane
• Collaborative search on the plane without communication
• Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• On the linear search problem
• Minimax Solutions for Linear Search Problems
• Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
• How many ants does it take to find the food?
• Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
• Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
• Evacuating two robots from a disk: a second cut
• Distributed Evacuation in Graphs with Multiple Exits
• 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

Cited In (1)

• Search and rescue on the line

This page was built for publication: Two-agent tree evacuation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117727)