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

DOI10.1145/3583668.3594561OpenAlexW4380874519WikidataQ130816817 ScholiaQ130816817MaRDI QIDQ6202224FDOQ6202224

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

• Title not available (Why is that?)
• Compact oracles for reachability and approximate distances in planar digraphs
• Compact routing on Euclidian metrics
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Distributed Computing
• Title not available (Why is that?)
• Competitive routing in hybrid communication networks
• Near-optimal distributed DFS in planar graphs
• Planar diameter via metric compression
• Near-optimal distributed routing with low memory
• Improved parallel depth-first search in undirected planar graphs
• Title not available (Why is that?)

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)