Discrete evacuation in graphs with multiple exits

DOI10.1016/J.TCS.2025.115141MaRDI QIDQ7014480zbMATH OpenFDO

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

Publication date 11 March 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115141

zbMATH Keywords

collision-free network evacuationdiscrete evacuationdistributed algorithmmobile agentsnetwork flow

Mathematics Subject Classification ID

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

Cites work

• A simplified NP-complete satisfiability problem
• Asynchronous rendezvous with different maps
• Collaboration without communication: evacuating two robots from a disk
• Collision-free network exploration
• Constructing maximal dynamic flows from static flows
• Deterministic rendezvous with different maps
• Distributed Evacuation in Graphs with Multiple Exits
• Evacuating from \(\ell_p\) unit disks in the wireless model
• Evacuating robots from a disk using face-to-face communication
• Evacuating robots via unknown exit in a disk
• Evacuating two robots from a disk: a second cut
• Group search on the line
• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Multiple sink location problems in dynamic path networks
• Oracle size, a new measure of difficulty for communication tasks
• Searching and sweeping graphs: a brief survey
• Searching by heterogeneous agents
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Two-agent tree evacuation
• Wireless evacuation on \(m\) rays with \(k\) searchers

This page was built for publication: Discrete evacuation in graphs with multiple exits

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