Theory of Trinomial Heaps

Authors:
Tadao Takaoka
Affiliations:
-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 4
Cited 3

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
A data structure for manipulating priority queues

Communications of the ACM
Theory of 2-3 heaps

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Efficient planning in R-max

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Research paper: The saga of minimum spanning trees

Computer Science Review
Rank-Pairing Heaps

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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(log n) 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.