Using Selective Path-Doubling for Parallel Shortest-Path Computations

Journal of Algorithms

Volumn 22, Issue 1, 1997, Pages 30-56

  Cohen, Edith ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (17)

1. N. Alon, Z. Galil, O. Margalit, and M. Naor, Witnesses for boolean matrix multiplication and for shortest paths, in "Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, 1992," pp. 417-426.
2. E. Cohen, Polylog-time and near-linear work approximation scheme for undirected shortest-paths, in "Proc. 26th Annual ACM Symposium on Theory of Computing, 1994," pp. 16-26.
3. R. J. Cole, An optimally efficient selection algorithm, Information Processing Let. 26 (1988), 255-259.
4. R. J. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988), 770-785.
5. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symb. Comput. 9 (1990), 251-280.
6. T. Cormen, C. Leiserson, and R. Rivest, "Introduction to Algorithms," McGraw-Hill, New York, 1990.
7. Z. Galil and O. Margalit, A faster algorithm for the all pairs shortest path problem for undirected graphs, manuscript.
8. H. Gazit and G. L. Miller, An improved parallel algorithm that computes the BFS numbering of a directed graph, Information Processing Let. 28(2) (1988), 61-65.
9. H. Greene and D. E. Knuth, "Mathematics for the Analysis of Algorithms," Birkhauser, Boston, 1982.
10. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Volume A, pp. 869-941, MIT Press/Elsevier, Cambridge, MA, 1991.
11. P. N. Klein, A parallel randomized approximation scheme for shortest paths, draft of journal version, 1992.
12. P. N. Klein and S. Sairam, A parallel randomized approximation scheme for shortest paths, in "Proc. 24th Annual ACM Symposium on Theory of Computing, 1992," pp. 750-758.
13. R. Seidel, On the all-pairs shortest-path problem, in "Proc. 24th Annual ACM Symposium on Theory of Computing, 1992," pp. 745-749.
14. Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algorithms 3 (1982), 57-67.
15. T. H. Spencer, More time-work tradeoffs for parallel graph algorithms, in "Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991," pp. 81-93.
16. T. H. Spencer, Time-work tradeoffs for parallel graph algorithms, in "Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms, 1991," pp. 425-432.
17. J. D. Ullman and M. Yannakakis, High-probability parallel transitive closure algorithms, SIAM J. Comput. 20 (1991), 100-125.