Theory of 2-3 Heaps
Conference paper
First Online:
- 4 Citations
- 752 Downloads
Abstract
As an alternative to the Fibonacci heap, we design a new data structure called a 2-3 heap, which supports m decrease-key and insert operations, and n delete-min operations in O(m + n log n) time. The merit of the 2—3 heap is that it is conceptually simpler and easier to implement. The new data structure will have a wide application in graph algorithms.
Keywords
Main Trunk Work Space Head Node Binary Search Tree Insert Operation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Adel'son-Vel'skii, G.M, and Y.M. Landis, An algorithm for the organization of information, Soviet Math. Dokl. 3 (1962) 1259–1262.Google Scholar
- 2.Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).Google Scholar
- 3.Ahuja, K., K. Melhorn, J.B. Orlin, and R.E. Tarjan, Faster algorithms for the shortest path problem, Jour. ACM, 37 (1990) 213–223.zbMATHCrossRefGoogle Scholar
- 4.Bondy, J.A. and U.S.R. Murty, Graph Theory with Applications, Macmillan Press (1976).Google Scholar
- 5.Dijkstra, E.W., A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269–271.zbMATHCrossRefMathSciNetGoogle Scholar
- 6.Fredman, M.L. and R,E, Tarjan, Fibonacci heaps and their uses in inproved network optimization algorithms, Jour. ACM 34 (1987) 596–615CrossRefMathSciNetGoogle Scholar
- 7.Prim, R.C., Shortest connection networks and some generalizations, Bell Sys. Tech. Jour. 36 (1957) 1389–1401.Google Scholar
- 8.Vuillemin, J., A data structure for manipulating priority queues, Comm. ACM 21 (1978) 309–314.zbMATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1999