Scalability of parallel algorithms for the all-pairs shortest-path problem
- 1 October 1991
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 13 (2) , 124-138
- https://doi.org/10.1016/0743-7315(91)90083-l
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Reevaluating Amdahl's lawCommunications of the ACM, 1988
- A complexity theory of efficient parallel algorithmsPublished by Springer Nature ,1988
- Parallel depth first search. Part II. AnalysisInternational Journal of Parallel Programming, 1987
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984