Sciweavers

SWAT
2004
Springer

Melding Priority Queues

13 years 9 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the priority queue, can be converted into a priority queue data structure that also supports fast meld operations with essentially no increase in the amortized cost of the other operations. More specifically, the new data structure supports insert, meld and find-min operations in O(1) amortized time, and delete operations in O(pq(n) + α(n, n)) amortized time, where α(m, n) is a functional inverse of the Ackermann function. The construction is very simple, essentially just placing a non-meldable priority queue at each node of a union-find data structure. We also show that when all keys are integers in the range [1, N], we can replace n in the bound stated above by min{n, N}. Applying this result to non-meldable priority queue data structures obtained recently by Thorup, and by Han and Thorup, we obtain meldable R...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where SWAT
Authors Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
Comments (0)