Theory of Trinomial Heaps
Conference paper
First Online:
- 3 Citations
- 307 Downloads
Abstract
We design a new data structure, called a trinomial heap, which supports a decrease-key in O(1) time, and an insert operation and delete-min operation in O(logn) time, both in the worst case, where n is the size of the heap. The merit of the trinomial heap is that it is conceptually simpler and easier to implement than the previously invented relaxed heap. The relaxed heap is based on binary linking, while the trinomial heap is based on ternary linking.
Keywords
Active Node Main Trunk Head Node Insert Operation Linear Tree
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.Dijkstra, E.W., A note on two problems in connexion with graphs, Numer. Math. 1 1959 269–271.zbMATHCrossRefMathSciNetGoogle Scholar
- 2.Driscoll, J.R., H.N. Gabow, R. Shrairman, and R.E. Tarjan, An alternative to Fibonacci heaps with application to parallel computation, Comm. ACM, 31(11) 1988 1343–1345.CrossRefMathSciNetGoogle Scholar
- 3.Fredman, M.L. and R.E. Tarjan, Fibonacci heaps and their uses in inproved network optimization algorithms, Jour. ACM 34 1987 596–615Google Scholar
- 4.Prim, R.C., Shortest connection networks and some generalizations, Bell Sys. Tech. Jour. 36 1957 1389–1401.Google Scholar
- 5.Takaoka, T., Theory of 2-3 Heaps, COCOON 99, Lecture Notes of Computer Science 1999 41–50Google Scholar
- 6.Vuillemin, J., A data structure for manipulating priority queues, Comm. ACM 21 1978 309–314.zbMATHCrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2000