Fast Meldable Priority Queues

Forfattere

  • Gerth Stølting Brodal

DOI:

https://doi.org/10.7146/brics.v2i12.19515

Resumé

We 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
time.

Downloads

Publiceret

1995-01-12

Citation/Eksport

Brodal, G. S. (1995). Fast Meldable Priority Queues. BRICS Report Series, 2(12). https://doi.org/10.7146/brics.v2i12.19515

Nummer

Nr. 12 (1995): RS-12 Fast Meldable Priority Queues

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).