Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)

Volumn 34, Issue 3, 1987, Pages 596-615

  Fredman, Michael L ^a   Tarjan, Robert Endre ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS - OPTIMIZATION; COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

BINOMIAL QUEUES; FIBONACCI HEAPS; NETWORK OPTIMIZATION ALGORITHMS; WORST-CASE BOUNDS;

DATA PROCESSING;

EID: 0023384210     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/28869.28874     Document Type: Article

References (28)

1. AHO, A. V., HOPCROFT, J. E., and ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. 1974.]
2. BROWN, M.R. Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7, 3 (Aug. 1978), 298-319.]
3. CAMERINI, P. M., FRATTA, L., and MAFFIOLI, F. A note on finding optimum branchings. Networks 9, 4 (Winter 1979), 309-312.]
4. CHERITON, D., AND TARJAN, R.E. Finding minimum spanning trees. SIAM J. Comput. 5, 4 (Dec. 1976), 724-742.]
5. DIJKSTRA, E.W. A note on two problems in connexion with graphs. Numer. Math. 1, 4 (Sept. 1959), 269-27 i.]
6. EDMONDS, J., AND KARP, R.M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 2 (Apr. 1972), 248-264.]
7. GABOW, H. N., AND STALLMAN, M. Efficient algorithms for the parity and intersection problems on graphic matroids. In Automata, Languages, and Programming, 12th Colloquium, Lecture Notes in Computer Science, Vol. 194, W. Brauer, Ed. Springer-Vedag, New York, 1985, pp. 210-220.]
8. GABOW, H. N., AND TARJAN, R. E. Efficient algorithms for a family of matroid intersection problems. J. Algorithms 5, 1 (Mar. 1984), 80-131.]
9. GABOW, H. N., GALIL, Z., AND SPENCER, T. Efficient implementation of graph algorithms using contraction. In Proceedings of the 25th Annual IEEE Symposium on Foundations of Computing. (Singer Island, Fla., Oct. 24-26). }EEL Press, New York, 1984 pp. 338-346.]
10. GABOW, H. N., GALIL, Z., SPENCER, T., AND TARJAN, R. E. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 2 (1986), 109-122.]
11. GRAHAM, R. L., AND HELL, P. On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7, I (Jan. 1985), 43-57.]
12. JARNIK, V. A jist6m probl6mu minimalnim. Prdca Moravskb PT'irodovbdeckb Spoleknosti 6 (1930), 57-63 (in Czechoslovakian
13. JOHNSON, D. B. Efficient algorithms for shortest paths in sparse networks. J. ACM 24, l (Jan. 1977), 1-13.]
14. KNUTH, D.E. The Art of Computer Programming. Vol. 1, Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, Mass. 1973.]
15. KNtrrH, D.E. The Art of Computer Programming. Vol. 3, Sorting and Searching. Addison- Wesley, Reading, Mass., 1973.]
16. KNUTH, D.E. A generalization of Dijkstra's algorithm. Inf. Process. Lett. 6, 1 (Feb. 1977), 1-5.]
17. KOMLOS, J. Linear verification for spanning trees. In Proceedings of the 25th Annual IEEE Symposium on Foundations of Computing. (Singer Island, Fla., Oct. 24-26). IEEE Press, New York, 1984 pp. 201-206.]
18. PRIM, R.C. Shortest connection networks and some generalizations. Bell Syst. Tech. ~ 36, 6 (Nov. 1957), 1389-1401.]
19. SLEATOR, D. O., and TARJAN, R.E. Self-adjusting heaps. SIAM J. Comput. 15, 1 (Feb. 1986), 52-69.]
20. SUURBALLE, J. W., and TARJAN, R. E. A quick method for finding shortest pairs of paths. Networks 14 (1984), 325-336.]
21. TAIUAN, R.E. Finding optimum branchings. Networks 7, 1 (Spring 1977), 25-35.]
22. TARJAN, R. E. A class of algorithms which require nonlinear time to maintain disjoint sets. I. Comput. Syst. Sci. 18, 2 (Apr. 1979), 110-127.]
23. TARJAN, R.E. Applications of path compression on balanced trees. J. ACM 26, 4 (Oct. 1979), 690-715. ~]
24. TARJAN, R. E. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 1983.]
25. TARJAN, R.E. Amortized computational complexity. SIAM J. Algebraic Discrete Methods 6, 2 (Apr. 1985), 306-318.]
26. TAgJAN, R. E., and VAN L~EUWEN, J. Worst-case analysis of set union algorithms. J. ACM 31, 2 (I 984), 245-28 i.]
27. VUILLEMIN, J. A data structure for manipulating priority queues. Commun. ACM 21, 4 (Apr. 1978), 309-315.]
28. YAO, A. An O(IEI log log I V I) algorithm for finding minimum spanning trees. Inf. Process, Lett. 4, I (Sept. 1975), 21-23.]