A Randomized Parallel Algorithm for Single-Source Shortest Paths

Journal of Algorithms

Volumn 25, Issue 2, 1997, Pages 205-220

  Klein, Philip N ^a   Subramanian, Sairam ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242514347     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0888     Document Type: Article

References (18)

1. A. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. H. Bast, M. Dietzfelbinger, and T. Hagerup, A perfect parallel dictionary, in "17th Symposium on Mathematical Foundations of Computer Science, 1992.
3. E. Cohen, Efficient parallel shortest-paths in diagraphs with a separator decomposition, in "5th ACM Symposium on Parallel Algorithms and Architectures, 1993," pp. 57-67.
4. E. Cohen, Fast algorithms for constructing t-spanners and paths with stretch t, in "34th IEEE Symposium on Foundations of Computer Science, 1993.
5. E. Cohen, Polylog-time and near-linear work approximation scheme for undirected shortest paths, in "Proceedings of the 26th ACM Symposium on Theory of Computing, 1994.
6. T. H. Cormen, C. E. Lieserson, and R. E. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
7. D. Eppstein and Z. Galil, Parallel algorithmic techniques for combinatorial computation, preprint, 1988.
8. H. N. Gabow, Scaling algorithms for network problems, J. Comput. System Sci. 31 (1985), 148-168.
9. H. Gazit and G. L. Miller, An improved parallel algorithm that computes the BFS numbering of a directed graph, Inform. Process. Lett. 28 (1988), 61-65.
10. J. Gil, Y. Matias, and U. Vishkin, Towards a theory of nearly constant time parallel algorithms, "Proceedings of the 32nd Symposium on Foundations of Computer Science," 1991, pp. 698-710.
11. T. Hagerup and R. Raman, Waste makes haste: tight bounds for loose parallel sorting, in "Proceedings of the 33rd IEEE Symposium on Foundations of Computing, 1992," pp. 628-637.
12. P. Klein, "A Parallel Randomized Approximation Scheme for Shortest Paths," Technical Report CS-91-56, Brown University, 1991.
13. P. Klein and S. Subramanian, A parallel randomized approximation scheme for shortest paths, in "Proceedings of the 24th ACM Symposium of Theory of Computing, 1992," pp. 750-758.
14. P. Klein and S. Subramanian, A linear-processor polylog-time algorithm for shortest-paths in planar graphs, in "Proceedings of the 34th IEEE Symposium on Foundations of Computing, 1993," pp. 750-758.
15. N. Megiddo, Parallel algorithms for finding the maximum and the median almost surely in constant time, preprint, 1982.
16. H. Shi and T. H. Spencer, "Time-Work Tradeoffs for the Single-Source Shortest Paths Problem," Technical Report CS-TR-94-1, Department of Computer Science, University of Nebraska, Omaha, 1994.
17. T. H. Spencer, More time-work tradeoffs for parallel graph algorithms, in "Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, 1991," pp. 81-93.
18. J. D. Ullman and M. Yannakakis, High-probability parallel transitive-closure algorithms, SIAM J. Comput. 20 (1991), 100-125.