JOURNAL ARTICLE
Scalability of parallel algorithms for the all-pairs shortest-path problem
Year: 1991 Journal: Journal of Parallel and Distributed Computing Vol: 13 (2)Pages: 124-138 Publisher: Elsevier BV
Keywords:
Scalability Computer science Hypercube Parallel computing Shortest path problem Algorithm Parallel algorithm Graph Metric (unit) Path (computing) Distributed memory Shared memory Theoretical computer science
Metrics
71
Cited By
8.56
FWCI (Field Weighted Citation Impact)
31
Refs
0.97
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Interconnection Networks and Systems
Physical Sciences → Computer Science → Computer Networks and Communications
Graph Theory and Algorithms
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem: A Summary of Results.
Journal: Proceedings of the International Conference on Parallel Processing Year: 1990 Vol: 32 (5)Pages: 136-140
BOOK-CHAPTER
Practical Algorithms for the All-Pairs Shortest Path Problem
Emergence, complexity and computation Year: 2018 Pages: 163-180
JOURNAL ARTICLE
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
Journal: Algorithmica Year: 1998 Vol: 20 (3)Pages: 309-318
BOOK-CHAPTER
An efficient parallel algorithm for the all pairs shortest path problem
Lecture notes in computer science Year: 1989 Pages: 276-287
BOOK-CHAPTER
Sub-cubic cost algorithms for the all pairs shortest path problem
Lecture notes in computer science Year: 1995 Pages: 333-343