Polylog-time and near-linear work approximation scheme for undirected shortest paths
- 1 January 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (1) , 132-166
- https://doi.org/10.1145/331605.331610
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch tSIAM Journal on Computing, 1998
- Time-work tradeoffs for parallel algorithmsJournal of the ACM, 1997
- Using Selective Path-Doubling for Parallel Shortest-Path ComputationsJournal of Algorithms, 1997
- Efficient Parallel Shortest-Paths in Digraphs with a Separator DecompositionJournal of Algorithms, 1996
- A parallel randomized approximation scheme for shortest pathsPublished by Association for Computing Machinery (ACM) ,1992
- High-Probability Parallel Transitive-Closure AlgorithmsSIAM Journal on Computing, 1991