Fibonacci heap
E321043
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Fibonacci heap canonical | 2 |
| Fibonacci heap data structure | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T3043247 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fibonacci heap Context triple: [Robert Tarjan, notableWork, Fibonacci heap]
-
A.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
-
B.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
C.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
D.
DSA
DSA (Digital Signature Algorithm) is a widely used public-key cryptographic standard designed for creating and verifying digital signatures to ensure data integrity and authentication.
-
E.
BST
BST (British Summer Time) is the daylight saving time observed in the United Kingdom, set one hour ahead of Coordinated Universal Time (UTC+1) during the summer months.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Fibonacci heap Target entity description: A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
-
A.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
-
B.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
C.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
D.
DSA
DSA (Digital Signature Algorithm) is a widely used public-key cryptographic standard designed for creating and verifying digital signatures to ensure data integrity and authentication.
-
E.
BST
BST (British Summer Time) is the daylight saving time observed in the United Kingdom, set one hour ahead of Coordinated Universal Time (UTC+1) during the summer months.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
heap data structure
ⓘ
priority queue implementation ⓘ |
| advantage |
very fast amortized decrease-key
ⓘ
very fast amortized merge ⓘ |
| basedOn | collection of heap-ordered trees ⓘ |
| belongsToField |
computer science
ⓘ
data structures ⓘ |
| cascadingCutTriggeredBy | second child cut from a node ⓘ |
| childListStructure | circular doubly linked list ⓘ |
| comparedTo |
binary heap
ⓘ
binomial heap ⓘ |
| consolidationOccursDuring | delete-minimum ⓘ |
| degreeBound | O(log n) ⓘ |
| disadvantage |
complex implementation
ⓘ
large constant factors ⓘ |
| hasVariant | pairing heap (as a practical alternative) ⓘ |
| introducedBy |
Michael L. Fredman
ⓘ
Robert Tarjan ⓘ
surface form:
Robert E. Tarjan
|
| introducedInYear | 1984 ⓘ |
| namedAfter |
Fibonacci sequence
ⓘ
surface form:
Fibonacci numbers
|
| nodeStructure |
has child pointer
ⓘ
has degree ⓘ has key ⓘ has left sibling pointer ⓘ has mark bit ⓘ has parent pointer ⓘ has right sibling pointer ⓘ |
| outperformsInAmortizedSense |
decrease-key compared to binary heap
ⓘ
merge compared to binary heap ⓘ |
| property | min-heap order ⓘ |
| rootListStructure | doubly linked list ⓘ |
| supports | lazy consolidation ⓘ |
| supportsOperation |
decrease-key
ⓘ
delete ⓘ delete-minimum ⓘ find-minimum ⓘ insert ⓘ merge ⓘ |
| timeComplexityAmortized |
O(1) for decrease-key
ⓘ
O(1) for find-minimum ⓘ O(1) for insert ⓘ O(1) for merge ⓘ O(log n) for delete ⓘ O(log n) for delete-minimum ⓘ |
| typicalUseCase | graph algorithms with many decrease-key operations ⓘ |
| usedInAlgorithm |
Dijkstra's shortest path algorithm
ⓘ
Prim's minimum spanning tree algorithm ⓘ |
| usesTechnique | cascading cut ⓘ |
| worstCaseTimeComplexity | O(n) for build-heap by repeated insert ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Fibonacci heap Description of subject: A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Fibonacci heap data structure