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

DOI10.1145/3583668.3594561MaRDI QIDQ6202224zbMATH OpenOpenAlexWikidataFDO

Authors Thorsten Götte, Christian Scheideler, Julian Werthmann

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

distributed algorithmplanar graphcompact routing

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• scientific article; zbMATH DE number 7650073 (Why is no real title available?)
• scientific article; zbMATH DE number 7650398 (Why is no real title available?)
• Compact oracles for reachability and approximate distances in planar digraphs
• Compact routing on Euclidian metrics
• Competitive routing in hybrid communication networks
• Distributed Computing
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Improved parallel depth-first search in undirected planar graphs
• Near-optimal distributed DFS in planar graphs
• Near-optimal distributed routing with low memory
• Planar diameter via metric compression

This page was built for publication: Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs

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