Computing Shortest Paths and Diameter in the Hybrid Network Model

DOI10.1145/3382734.3405719OpenAlexW3046430097MaRDI QIDQ5855213

Fabian Kuhn, Philipp Schneider

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://arxiv.org/abs/2006.08408

Mathematics Subject Classification ID

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

Related Items (4)

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts ⋮ Time-optimal construction of overlay networks ⋮ Distributed computing with the Cloud ⋮ Routing schemes for hybrid communication networks

This page was built for publication: Computing Shortest Paths and Diameter in the Hybrid Network Model