An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
From MaRDI portal
Publication:4349697
DOI10.1006/jagm.1996.0842zbMath0879.68008OpenAlexW2061073017MaRDI QIDQ4349697
No author found.
Publication date: 17 December 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0842
Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)
Related Items (5)
Distributed finite-time calculation of node eccentricities, graph radius and graph diameter ⋮ An improved Dijkstra's shortest path algorithm for sparse network ⋮ Distributed distance computation and routing with small messages ⋮ A fully dynamic algorithm for distributed shortest paths. ⋮ Fault-tolerant computation of distributed regular path queries
This page was built for publication: An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
