Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs

DOI10.1145/3583668.3594561OpenAlexW4380874519MaRDI QIDQ6202224

Unnamed Author, Unnamed Author, Julian Werthmann, Thorsten Götte, Christian Scheideler

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3583668.3594561

zbMATH Keywords

planar graphdistributed algorithmcompact routing

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
• Improved parallel depth-first search in undirected planar graphs
• Near-Optimal Distributed Routing with Low Memory
• Planar diameter via metric compression
• Distributed Computing
• Compact oracles for reachability and approximate distances in planar digraphs
• Compact routing on euclidian metrics
• Competitive routing in hybrid communication networks