Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM

Volumn 46, Issue 3, 1999, Pages 362-394

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Ram algorithms; Shortest paths

Indexed keywords

DISCRETE STRUCTURES; LINEAR TIME; RAM ALGORITHMS; SHORTEST PATHS;

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; GRAPH THEORY; HIERARCHICAL SYSTEMS; PROBLEM SOLVING;

INTEGER PROGRAMMING;

EID: 0000778521     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/316542.316548     Document Type: Article

References (25)

1. AHUJA, R. K., MELHORN, K., ORLIN, J. B., AND TARJAN, R. E. 1990. Faster algorithms for the shortest path problem. J. ACM 37, 213-223.
2. ALBERS, S. AND HAGERUP, T. 1997. Improved parallel integer sorting without concurrent writing. Inf. Control 136, 25-51.
3. ANDERSSON, A., HAGERUP, T., NILSSON, S., AND RAMAN, R. 1995. Sorting in linear time? In Proceedings of the 27th Annual A CM Symposium on the Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 427-436.
4. 0 instructions only. Theoret. Comput. Sci., 215, 337-344.
5. CHERKASSKY, B. V., GOLDBERG, A. V., AND SILVERSTEIN, C. 1997. Buckets, heaps, lists, and monotone priority queues. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 83-92.
6. DIJKSTRA, E. W. 1959. A note on two problems in connection with graphs. Numer. Math. 1, 269-271.
7. DINIC, E. A. 1978. Finding shortest paths in a network. In Transportation Modeling Systems, Y. Popkov and B. Shmulyian, eds. Institute for System Studies, Moscow, CIS, pp. 36-44.
8. FREDMAN, M. L., AND TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 3 (July), 596-615.
9. FREDMAN, M. L., AND WILLARD, D. E. 1993. Surpassing the information theoretic bound with fusion trees. J. Comptit. Syst. Sci. 47, 424-436.
10. FREDMAN, M. L., AND WILLARD, D. E. 1994. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci. 48, 533-551.
11. GABOW, H. N. 1985. A scaling algorithm for weighted matching on general graphs. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 90-100.
12. GABOW, H. N. AND TARJAN, R. E. 1985. A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30, 209-221.
13. HENZINGER, M. R., KLEIN, P., RAO, S., AND SUBRAMANIAN, S. 1997. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 53, 2-23.
14. KRUSKAL, J. B. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48-50.
15. MELHORN, K., AND NAIILER, S. 1990. Bounded ordered dictionaries in O(log log n) time and O(n) space. Inf. Proc. Lett. 35, 183-189.
16. RAMAN, R. 1996. Priority queues: small monotone, and trans-dichotomous. In Proceedings of the 4th Annual European Symposium on Algorithms. Lecture Notes on Computer Science, vol. 1136, Springer-Verlag, New York, pp. 121-137.
17. RAMAN, R. 1997. Recent results on the single-source shortest paths problem. SICACT News 28, 81-87.
18. TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (Apr.), 215-225.
19. THORUP, M. 1996. On RAM priority queues. In Proceedings of the 7th Annual ACM-SLAM Symposium on Discrete Algorithms. ACM, New York, pp. 59-67.
20. THORUP, M. 1998. Floats, integers, and single source shortest paths. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science. Lecture Notes on Computer Science, vol. 1373. Springer-Verlag, New York, pp. 14-24.
21. VAN EMDE BOAS, P. 1977. Preserving order in a forest in less than logarithmic time and linear space. Inf. Proc. Lett. 6, 80-82.
22. VAN EMDE BOAS, P., KAAS, R., AND ZIJLSTRA, E. 1977. Design and implementation of an efficient priority queue. Math. Syst. Theory 10, 99-127.
23. WILLARD, D. E. 1992. Applications of the fusion tree method to computational geometry and
24. searching. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 386-395.
25. WILLIAMS, J. W. J. 1964. Heapsort. Commun. ACM 7, 6 (June), 347-348.