Parallel algorithms for the single source shortest path problem
- 1 March 1982
- journal article
- Published by Springer Nature in Computing
- Vol. 29 (1) , 31-49
- https://doi.org/10.1007/bf02254849
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Communication Issues in the Design and Analysis of Parallel AlgorithmsIEEE Transactions on Software Engineering, 1981
- Algorithm 562: Shortest Path Lengths [H]ACM Transactions on Mathematical Software, 1980
- A parallel algorithm for constructing minimum spanning treesJournal of Algorithms, 1980
- The Structure of Parallel AlgorithmsPublished by Elsevier ,1980
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977
- Formal verification of parallel programsCommunications of the ACM, 1976
- Verifying properties of parallel programsCommunications of the ACM, 1976
- A Note on Dijkstra's Shortest Path AlgorithmJournal of the ACM, 1973
- A note on two problems in connexion with graphsNumerische Mathematik, 1959