Practical efficiency of the linear-time algorithm for the single source shortest path problem

Journal of the Operations Research Society of Japan

Volumn 43, Issue 4, 2000, Pages 431-447

  Asano, Yasuhito ^a   Imai, Hiroshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034367591     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.43.431     Document Type: Article

References (11)

1. S. Albers and T. Hagerup: Improved parallel integer sorting without concurrent writing. Proceedings of 3rd ACM-SIAM Symposium on Discrete Algorithms, (1992) 463-472.
2. A. Andersson, T. Hagerup, S. Nilsson and R. Raman: Sorting in linear time? Proceedings of 27th ACM Symposium on Theory of Computing, (1995) 427-436.
3. B. V. Cherkassky, A. V. Goldberg and C. Silverstein: Buckets, heaps, lists, and monotone priority queues. Proceedings of 8th ACM-SIAM Symposium on Discrete Algorithms, (1997) 83-92.
4. E. W. Dijkstra: A note on two problems in connection with graphs. Numerische Mathematik, 1 (1959) 269-271.
5. M. L. Fredman and R. E. Tarjan: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34 (1987) 596-615.
6. M. L. Fredman and D. E. Willard: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48 (1994) 533-551.
7. H. N. Gabow and R. E. Tarjan: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30 (1985) 209-221.
8. A. V. Goldberg and C. Silverstein: Implementations of Dijkstra's Algorithm Based on Multi-level Buckets. Technical Report 95-187 (NEC Research Institute, Prinston, NJ, 1995).
9. H. Imai and M. Iri: Practical effeciencies of existing shortest-path algorithms and a new bucket algorithm. Journal of the Operation Research Society in Japan, 43 (1984) 43-58.
10. M. Thorup: Undirected single source shortest paths in linear time. Proceedings of the 38th Symposium on Foundations of Computer Science, (1997) 12-21.
11. J. Williams: Heapsort. Communications of the ACM, 7 (1964) 347-348.