The bounds of min-max pair heap construction

DOI10.1016/S0898-1221(01)00331-5zbMath0994.90043OpenAlexW1971265364MaRDI QIDQ1609155

R. Smith

Publication date: 15 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00331-5

zbMATH Keywords

algorithmdouble ended priority queue

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Study on massive-scale slow-hash recovery using unified probabilistic context-free grammar and symmetrical collaborative prioritization with parallel machines

Cites Work

• The relaxed min-max heap: A mergeable double-ended priority queue
• Min-max heaps and generalized priority queues

This page was built for publication: The bounds of min-max pair heap construction