The relaxed min-max heap: A mergeable double-ended priority queue

DOI10.1007/BF01179371zbMath0790.68026OpenAlexW121517553MaRDI QIDQ1323336

Mark Allen Weiss, Yuzheng Ding

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01179371

zbMATH Keywords

priority queuedata structurerelaxed min-max heap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

Two new methods for constructing double-ended priority queues from priority queues ⋮ Multidimensional heaps and complementary range searching ⋮ Fast meldable priority queues ⋮ The K-D heap: An efficient multi-dimensional priority queue ⋮ Reflected min-Max heaps ⋮ A Survey on Priority Queues ⋮ The bounds of min-max pair heap construction

Uses Software

• heapsort

Cites Work

• The pairing heap: A new form of self-adjusting heap
• Bounds for min-max heaps
• A pointer-free data structure for merging heaps and min-max heaps
• Min-max heaps and generalized priority queues
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• Self-Adjusting Heaps

This page was built for publication: The relaxed min-max heap: A mergeable double-ended priority queue