Construct · 1 fields · 1 citations

Fibonacci heap: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Fibonacciheap1 CONSTRUCTFibonacci heapFREDMAN · ALGORITHMS AND DATA

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

a priority queue built from a lazy collection of heap-ordered trees that gives constant amortized insert and decrease-key, speeding up shortest-path and spanning-tree algorithms.

In algorithms and data structures, Fibonacci heap refers to a priority queue built from a lazy collection of heap-ordered trees that gives constant amortized insert and decrease-key, speeding up shortest-path and spanning-tree algorithms. This meaning comes from Fredman (1987) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Fibonacci heap sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

meld1 fields · 2 citationsanchor · a standalone constructconstant2 fields · 2 citationsjingle · one word, two constructsheap2 fields · 4 citationsjingle · one word, two constructs

References

  1. Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3), 596-615. https://doi.org/10.1145/28869.28874

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct