Distributed Evacuation in Graphs with Multiple Exits

DOI10.1007/978-3-319-48314-6_15zbMath1482.68238OpenAlexW2548896421WikidataQ62043603 ScholiaQ62043603MaRDI QIDQ2835028

Shantanu Das, Dariusz Dereniowski, Łukasz Kuszner, Piotr Borowiecki

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_15

zbMATH Keywords

network flowdistributed algorithmmobile agentsdiscrete evacuation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)

Related Items (6)

Collaboration Without Communication: Evacuating Two Robots from a Disk ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Search and rescue on the line ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Two-agent tree evacuation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simplified NP-complete satisfiability problem
• Multiple sink location problems in dynamic path networks
• Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Group Search on the Line
• Deterministic Rendezvous in Restricted Graphs
• Oracle size
• Evacuating Robots via Unknown Exit in a Disk

This page was built for publication: Distributed Evacuation in Graphs with Multiple Exits