Title of article :
The bounds of min-max pair heap construction
Author/Authors :
R. A. Chowdhury، نويسنده , , M. Z. Rahman، نويسنده , , M. Kaykobad، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Abstract :
In this paper, lower and upper bounds for min-max pair heap construction has been presented. It has been shown that the construction of a min-max pair heap with n elements requires at least 2.07n element comparisons. A new algorithm for creating min-max pair heap has been devised that lowers the upper bound to 2.43n.
Keywords :
Min-max pair heap , Min-max heap , Algorithm , Heap , Double-ended priority queue
Journal title :
Computers and Mathematics with Applications
Journal title :
Computers and Mathematics with Applications
