Quote: the pairing heap is simpler and faster than the Fibonacci heap; min value at root; multiple children and no parent pointers

Quotation Skeleton

[The pairing heap, Fredman et al Algorithmica 1.1, 1986] is best viewed as a stripped-down, no-frills … The pairing heap uses a single tree structure … values respects the heap-order condition: the value stored … We thus find the minimum heap value stored … have, and the children of a node are … [p. 475] parent pointers are not present in the … the pairing heap is considered to be a … [Despite the] excellent experimental results [refs], … the asymptotic efficiency is sacrificed; under some circumstances …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Group: data structures   (12 topics, 275 quotes)