Using Selective Path-Doubling for Parallel Shortest-Path Computations
- 1 January 1997
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 22 (1) , 30-56
- https://doi.org/10.1006/jagm.1996.0813
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Polylog-time and near-linear work approximation scheme for undirected shortest pathsPublished by Association for Computing Machinery (ACM) ,1994
- A parallel randomized approximation scheme for shortest pathsPublished by Association for Computing Machinery (ACM) ,1992
- On the all-pairs-shortest-path problemPublished by Association for Computing Machinery (ACM) ,1992
- Witnesses for Boolean matrix multiplication and for shortest pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- High-Probability Parallel Transitive-Closure AlgorithmsSIAM Journal on Computing, 1991
- More time-work tradeoffs for parallel graph algorithmsPublished by Association for Computing Machinery (ACM) ,1991
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Parallel Merge SortSIAM Journal on Computing, 1988
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982