Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:architecture
heap |
| gptkbp:advantage |
simplicity
good practical performance |
| https://www.w3.org/2000/01/rdf-schema#label |
pairing heap
|
| gptkbp:introduced |
1986
|
| gptkbp:inventedBy |
gptkb:Robert_E._Tarjan
Fredman, Michael L. |
| gptkbp:main_disadvantage |
worse theoretical bounds than Fibonacci heap
|
| gptkbp:publishedIn |
gptkb:SIAM_Journal_on_Computing
|
| gptkbp:relatedTo |
gptkb:binary_heap
Fibonacci heap binomial heap |
| gptkbp:structureType |
gptkb:tree
|
| gptkbp:supports |
insert
delete-min meld decrease-key find-min |
| gptkbp:time_complexity_(decrease-key) |
O(log n) amortized
|
| gptkbp:time_complexity_(delete-min) |
O(log n) amortized
|
| gptkbp:time_complexity_(find-min) |
O(1)
|
| gptkbp:time_complexity_(insert) |
O(1) amortized
|
| gptkbp:time_complexity_(meld) |
O(1)
|
| gptkbp:usedFor |
priority queue
|
| gptkbp:bfsParent |
gptkb:PriorityQueue
|
| gptkbp:bfsLayer |
6
|