The bounds of min-max pair heap construction

DOI10.1016/S0898-1221(01)00331-5MaRDI QIDQ1609155zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A note on constructing min-max heaps
• Heap construction: Optimal in both worst and average cases?
• scientific article; zbMATH DE number 742986
• Bounds for min-max heaps
• A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm

Cites work

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

Cited in

(3)

• Reflected min-Max heaps
• Study on massive-scale slow-hash recovery using unified probabilistic context-free grammar and symmetrical collaborative prioritization with parallel machines
• Min-max heaps and generalized priority queues

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609155)