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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W., A note on two problems in connexion with graphs, Numer. Math. 1 1959 269–271.
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.
Fredman, M.L. and R.E. Tarjan, Fibonacci heaps and their uses in inproved network optimization algorithms, Jour. ACM 34 1987 596–615
Prim, R.C., Shortest connection networks and some generalizations, Bell Sys. Tech. Jour. 36 1957 1389–1401.
Takaoka, T., Theory of 2-3 Heaps, COCOON 99, Lecture Notes of Computer Science 1999 41–50
Vuillemin, J., A data structure for manipulating priority queues, Comm. ACM 21 1978 309–314.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takaoka, T. (2000). Theory of Trinomial Heaps. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_36
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive