Meldable RAM priority queues and minimum directed spanning trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 40-48

  Mendelson, Ran ^a   Thorup, Mikkel ^b   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; TREES (MATHEMATICS);

PRIORITY QUEUES; SPANNING TREES;

RANDOM ACCESS STORAGE;

EID: 1842525829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. [AHU74] A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
2. [AMOT90] R.K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan. Faster algorithms for the shortest path problem. Journal of the ACM, 37:213-223, 1990.
3. [Boc71] F. Bock. An algorithm to construct a minimum directed spanning tree in a directed network, in: Developments in Operations Research, Gordon and Breach, New York, pages 29-44, 1971.
4. [Bro96] G.S. Brodal. Worst-case efficient priority queues. In Proc. of 7th SODA, pages 52-58, 1996.
5. [CFM79] P.M. Camerini, L. Fratta, and F. Maffioli. A note on finding optimum branchings. Networks, 9:309-312, 1979.
6. [CGS99] B.V. Cherkassky, A.V. Goldberg, and C. Silverstein. Buckets, heaps, lists, and monotone priority queues. SIAM Journal on Computing, 28(4): 1326-1346, 1999.
7. [Cha00] B. Chazelle. A minimum spanning tree algorithm with inverse ackermann type complexity. Journal of the ACM, 47(6):1028-1047, 2000.
8. [CL65] Y.J. Chu and T.H. Liu. On the shortest arborescence of a directed graph. Sci. Sinica, 14:1396-1400, 1965.
9. [CLRS01] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, second edition, 2001.
10. [Dij59] B.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
11. +94] M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. Dynamic perfect hashing: upper and lower bounds. SIAM Journal on Computing, 23(4):738-761, 1994.
12. [Edm67] J. Edmonds. Optimum branchings. J. Res. Nat. Bur. Standards, 71B:233-240, 1967.
13. [FT87] M.L. Fredman and R.E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, 34:596-615, 1987.
14. [FW93] M.L. Fredman and D.E. Willard. Surpassing the information- theoretic bound with fusion trees. Journal of Computer and System Sciences, 47(3):424-436, 1993.
15. [FW94] M.L. Fredman and D.E. Willard. Transdichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533-551, 1994.
16. [GGS89] H.N. Gabow, Z. Galil, and T.H. Spencer. Efficient implementation of graph algorithms using contraction. Journal of the ACM, 36(3):540-572, July 1989.
17. [GGST86] H.N. Gabow, Z. Galil, T.H. Spencer, and R.E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6:109-122, 1986.
18. [Han02] Y. Han. Deterministic sorting in o(n log log n) time and linear space. In Proc. of 34th STOC, pages 602-608, 2002.
19. [HT02] Y. Han and M. Thorup. Integer sorting in O(n√log log n) expected time and linear space. In Proc. of 43rd FOCS, pages 135-144, 2002.
20. [Kar71] R.M. Karp. A simple derivation of Edmonds' algorithm for optimum branchings. Networks, 1:265-272, 1971.
21. [KKT95] D.R. Karger, P.N. Klein, and R.E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42:321-328, 1995.
22. [KST02a] H. Kaplan, N. Shafrir, and R.E. Tarjan. Meldable heaps and boolean union-find. Proc. of 34th STOC, pages 573-582, 2002.
23. [KST02b] H. Kaplan, N. Shafrir, and R.E. Tarjan. Union-find with deletions. In Proc. of 13th SODA, pages 19-28, 2002.
24. [Pri57] R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
25. [Ram97] R. Raman. Recent results on the single-source shortest paths problem. SIGACT News, 28:81-87, 1997.
26. [Tar75] R.E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215-225, 1975.
27. [Tar77] R.E. Tarjan. Finding optimum branchings. Networks, 7:25-35, 1977.
28. [Tar83] R.E. Tarjan. Data structures and network algorithms. CBMS 44, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
29. [Tar85] R.E. Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6:306-318, 1985.
30. [Tho00] M. Thorup. On RAM priority queues. SIAM Journal on Computing, 30(1):86-109, 2000.
31. [Tho02] M. Thorup. Equivalence between priority queues and sorting. In Proc. of 43rd FOCS, pages 125-134, 2002.
32. [Tho03] M. Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. In Proc. of 35th STOC, pages 149-158, 2003.
33. [van77] P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6(3):80-82, 1977.
34. [vKZ77] P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
35. [Wil83] D. Willard. Log-logarithmic worst case range queries are possible in space O(N). Inform. Process Lett., pages 81-84, 1983.