Time-Work Tradeoffs of the Single-Source Shortest Paths Problem

Journal of Algorithms

Volumn 30, Issue 1, 1999, Pages 19-32

  Shi, Hanmao ^a   Spencer, Thomas H ^b,c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^c 5740 S 100Th Plaza #2A ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (14)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. E. Cohen, Efficient parallel shortest-paths in digraphs with a separator decomposition, in "5th Symposium on Parallel Algorithms and Architectures, 1993," pp. 57-67.
3. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988), 770-785.
4. E. Cohen, Undirected shortest paths in poly-log time and near-linear work, unpublished manuscript, 1993.
5. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, in "Proc. 19th Annual ACM Symposium on Theory of Computing, 1987" pp. 1-6.
6. E. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959), 269-271.
7. H. Gazit and G. L. Miller, An improved parallel algorithm that computes the BFS numbering of a directed graph, Inform. Process. Lett. (1988), 61-65.
8. R. M. Karp and V. Ramachandran, A survey of parallel algorithms for shared-memory machines, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), MIT Press, Cambridge, MA.
9. P. Klein and S. Subramanian, A parallel approximation scheme for shortest paths, in "Proc. 24th ACM Symp. on Theory of Computing, 1992," pp. 750-758.
10. P. Klein and S. Subramanian, A linear-processor poly-log time algorithm for shortest paths in planar graphs, in "Proc. 34th Symposium on the Foundations of Computer Science, 1993," pp. 259-270.
11. W. Paul, U. Vishkin, and H. Wagner, Parallel dictionaries on 2-3 trees, in "Automata, Languages and Programming" (J. Diaz, Ed.), pp. 597-609, 1983.
12. T. Spencer, Time-work tradeoffs for parallel graph algorithms, in "Second Annual ACM-SIAM Symposium on Discrete Math, 1991," pp. 425-432.
13. T. Spencer, More time-work tradeoffs for parallel graph algorithms, in "3rd Symposium on Parallel Algorithms and Architectures, 1991,"pp. 81-93.
14. J. Ullman and M. Yannakakis, High-probability parallel transitive closure algorithms, in "Symposium on Parallel Algorithms and Architectures, 1990," pp. 200-209.