Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:architecture
|
| gptkbp:allows |
corrupted keys
|
| gptkbp:citation |
gptkb:Chazelle,_Bernard._'The_soft_heap:_An_approximate_priority_queue_with_optimal_error_rate.'_Journal_of_the_ACM,_2000.
|
| gptkbp:complexity |
O(1) amortized insert
O(log(1/ε)) amortized delete-min |
| gptkbp:guarantees |
at most εn corrupted keys after n insertions
|
| https://www.w3.org/2000/01/rdf-schema#label |
soft heap
|
| gptkbp:introducedIn |
2000
|
| gptkbp:inventedBy |
gptkb:Bernard_Chazelle
|
| gptkbp:operator |
insert
delete-min meld |
| gptkbp:parameter |
error rate (ε)
|
| gptkbp:relatedTo |
heap
priority queue |
| gptkbp:usedIn |
gptkb:Chazelle's_minimum_spanning_tree_algorithm
approximate selection algorithms minimum spanning tree algorithms |
| gptkbp:bfsParent |
gptkb:John_Iacono
|
| gptkbp:bfsLayer |
5
|