Fast Meldable Priority Queues
Gerth Stølting Brodal February 1995 |
Abstract:We present priority queues that support the operations MAKEQUEUE, FINDMIN, INSERT and MELD in worst case time To our knowledge this is the first priority queue implementation that supports MELD in worst case constant time and DELETEMIN in logarithmic time. Available as PostScript, PDF. |