On finding and updating shortest paths distributively
- 30 June 1992
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 13 (2), 235-257
- https://doi.org/10.1016/0196-6774(92)90017-7
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of ProcessorsSIAM Journal on Computing, 1987
- Distributed computation on graphsCommunications of the ACM, 1982
- Sensitivity analysis of minimum spanning trees and shortest path treesInformation Processing Letters, 1982
- A note on the problem of updating shortest pathsNetworks, 1981
- Shortest-path problem is not harder than matrix multiplicationInformation Processing Letters, 1980
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- A Shortest Path Algorithm for Edge-Sparse GraphsJournal of the ACM, 1976
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$SIAM Journal on Computing, 1973
- A note on two problems in connexion with graphsNumerische Mathematik, 1959