Fast Meldable Priority Queues
AbstractWe present priority queues that support the operations MakeQueue,
FindMin, Insert and Meld in worst case time O(1) and Delete and
DeleteMin in worst case time O(log n). They can be implemented on the
pointer machine and require linear space. The time bounds are optimal for
all implementations where Meld takes worst case time o(n).
To our knowledge this is the first priority queue implementation that
supports Meld in worst case constant time and DeleteMin in logarithmic
How to Cite
Brodal, G. (1995). Fast Meldable Priority Queues. BRICS Report Series, 2(12). https://doi.org/10.7146/brics.v2i12.19515
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.