On finding and updating shortest paths distributively
From MaRDI portal
Publication:3990607
DOI10.1016/0196-6774(92)90017-7zbMath0767.68062OpenAlexW2012456804MaRDI QIDQ3990607
No author found.
Publication date: 28 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(92)90017-7
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (9)
All-pairs shortest paths and the essential subgraph ⋮ A loop-free shortest-path routing algorithm for dynamic networks ⋮ A fully dynamic algorithm for distributed shortest paths. ⋮ Enhancing the computation of distributed shortest paths on power-law networks in dynamic scenarios ⋮ Engineering a new algorithm for distributed shortest paths on dynamic networks ⋮ Efficient algorithms for optimistic crash recovery ⋮ Partially dynamic efficient algorithms for distributed shortest paths ⋮ The lower bounds on distributed shortest paths ⋮ An optimal distributed algorithm for recognizing mesh-connected networks
This page was built for publication: On finding and updating shortest paths distributively
