Reflected min-Max heaps

DOI10.1016/S0020-0190(02)00501-XzbMATH Open1173.68456OpenAlexW2058183193MaRDI QIDQ1007603FDOQ1007603

Kostas Tsichlas, Athanasios K. Tsakalidis, Christos Makris

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00501-x

Recommendations

• Min-max heaps and generalized priority queues
• Bounds for min-max heaps
• A note on constructing min-max heaps
• scientific article; zbMATH DE number 4047086
• The bounds of min-max pair heap construction
• The relaxed min-max heap: A mergeable double-ended priority queue
• An optimal algorithm for selection in a min-heap
• Rank-Pairing Heaps
• Rank-pairing heaps
• A pointer-free data structure for merging heaps and min-max heaps

zbMATH Keywords

algorithmsdata structurespriority queuesworst-case complexity

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• Title not available (Why is that?)
• A data structure for manipulating priority queues
• Min-max heaps and generalized priority queues
• Fast meldable priority queues
• A generalization of binomial queues
• Title not available (Why is that?)
• Symmetric min-max heap: a simpler data structure for double-ended priority queue
• The relaxed min-max heap: A mergeable double-ended priority queue
• Interval Heaps
• Title not available (Why is that?)

Cited In (5)

• Two new methods for constructing double-ended priority queues from priority queues
• Some Results for Elementary Operations
• Multidimensional heaps and complementary range searching
• Bounds for min-max heaps
• Min-max heaps and generalized priority queues

This page was built for publication: Reflected min-Max heaps

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