A Note on Worst Case Efficient Meldable Priority Queues

  • Authors:

  • Rolf Fagerberg

  • Affiliations:

  • -

  • Venue:
  • A Note on Worst Case Efficient Meldable Priority Queues
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give a simple implementation of meldable priority queues, achieving Insert, FindMin, and Meld in O(1) worst case time, and DeleteMin and Delete in O(log n) worst case time.