Searching for "The Relaxed min-max Heap." – sorted by Relevance.
-
A General Technique for Implementation of Efficient Priority Queues
- . Ding and Weiss [5] proposed the relaxed min-max heap. The double-ended binomial queue was proposed
- Cited by 5 (0 self) – Add To MetaCart
-
A General Technique for Implementation of Efficient Priority Queues
- ] proposed the relaxed min-max heap. The double-ended binomial queue was proposed by Khoong and Leong [10
- Add To MetaCart
-
Reflected Min-Max Heaps
- space by the two axes. Based on this structure the authors in [8] devised the relaxed min-max heaps
- Add To MetaCart

