Single-Source Shortest Paths in the CONGEST Model with Improved Bound

DOI10.1145/3382734.3405729OpenAlexW3046699603MaRDI QIDQ5855273

Doron Mukhtar, Shiri Chechik

Publication date: 15 March 2021

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

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

zbMATH Keywords

distributed algorithmsoverlay networkssingle-source shortest pathsbroadcast CONGEST

Mathematics Subject Classification ID

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

Related Items (3)

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Approximate minimum directed spanning trees under congestion

This page was built for publication: Single-Source Shortest Paths in the CONGEST Model with Improved Bound