Fibonacci heap
E321043
UNEXPLORED
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.
Aliases (1)
Referenced by (3)
| Subject (surface form when different) | Predicate |
|---|---|
|
Fibonacci sequence
→
|
isUsedInAlgorithm |
|
Robert Tarjan
("Fibonacci heap data structure")
→
|
notableConcept |
|
Robert Tarjan
→
|
notableWork |