Two-agent tree evacuation

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

Authors: Henri Devillez, Béni Egressy, Robin Fritsch, Roger Wattenhofer 

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)