The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index; none of the 35 sources its claims cite is checked for support yet.
Fibonacci heaps and their uses in improved network optimization algorithms
Open accessAbstract
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps ), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n -item heap in O (log n ) amortized time and all other standard heap operations in O (1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms. In particular, we obtain the following worst-case bounds, where n is the number of vertices and m the number of edges in the problem graph: O ( n log n + m ) for the single-source shortest path problem with nonnegative edge lengths, improved from O ( m log ( m/n +2) n ); O ( n 2 log n + nm ) for the all-pairs shortest path problem, improved from O ( nm log ( m/n +2) n ); O ( n 2 log n + nm ) for the assignment problem (weighted bipartite matching), improved from O ( nm log ( m/n +2) n ); O ( mβ ( m, n )) for the minimum spanning tree problem, improved from O ( m log log ( m/n +2) n ); where β ( m, n ) = min { i | log ( i ) n ≤ m/n }. Note that β ( m, n ) ≤ log * n if m ≥ n . Of these results, the improved bound for minimum spanning trees is the most striking, although all the results give asymptotic improvements for graphs of appropriate densities.
Overview
CoChat Summary
TL;DR
The paper introduces Fibonacci heaps (F-heaps), a meldable heap data structure with O(1) amortized time for most operations and O(log n) amortized time for delete-min/delete. It uses F-heaps to improve asymptotic running times for several network optimization problems, most notably minimum spanning trees to O(m β(m,n)).
Key findings
- F-heaps support delete min and delete in O(log n) amortized time and all other standard heap operations, including decrease key, in O(1) amortized time.
- Single-source shortest path with nonnegative edge lengths runs in O(n log n + m), improved from O(m log_{m/n+2} n); all-pairs shortest path and assignment run in O(n^2 log n + nm), improved from O(nm log_{m/n+2} n).
- Minimum spanning tree runs in O(m β(m,n)), improved from O(m log log_{m/n+2} n), where β(m,n) = min{i | log^{(i)} n ≤ m/n}; β(m,n) ≤ log* n if m ≥ n.
- Variants include F-heaps with vacant nodes, good/bad trees, a one-tree representation, and melded F-heaps with implicit keys supporting increase-all-keys.
Methods
- Design: F-heaps are collections of item-disjoint heap-ordered trees using linking, circular root/child lists, ranks, mark bits, cuts, and cascading cuts.
- Analysis: amortized bounds are proved with a potential function equal to the number of trees plus twice the number of marked nonroot nodes; Lemma 1 and Corollary 1 give rank/descendant properties, including at least F_{k+2} ≥ φ^k descendants for a rank-k node.
- Applications: Dijkstra’s algorithm uses one make-heap, n inserts, n delete-mins, and at most m decrease-keys; the MST algorithm uses multi-pass tree-growing with cleanup and a per-pass heap-size parameter. No empirical sample is reported; results are theoretical worst-case/amortized bounds.
Limitations
- The paper states that lazy deletion may use extra space if individual items are inserted and deleted many times; the good/bad-tree variant avoids vacant-node space but does not support implicit deletion.
- The paper states open questions: whether a self-adjusting version of F-heaps can achieve the same amortized bounds without ranks or cascading cuts, whether shortest-path and MST bounds can be improved, and whether other heap problems benefit.
- Evident from the text: the work is theoretical with no experimental benchmarks; network-optimization improvements are asymptotic for graphs of intermediate density (n < m << n^2), though the MST bound also improves sparse graphs.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 3 Not valid · 24 Not checked · 47 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A decrease key operation causes the potential to increase by at most three minus the number of cascading cuts, since the first cut converts a possibly unmarked nonroot node into a root, each cascading cut converts a marked nonroot node into a root, and the last cut (either first or cascading) can convert a nonroot node from unmarked to marked.”
§ Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms > 2. Fibonacci Heaps
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The advantage of this variant is that it requires no space for vacant nodes.”
§ Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms > 3. Variants of Fibonacci Heaps
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The total time for the delete min operation is proportional to the maximum rank of any of the nodes manipulated plus the number of linking steps.”
§ Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms > 2. Fibonacci Heaps
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“delete min (h) increases the potential by at most 1.4404 log n minus the number of linking steps, since, if the minimum node has rank k, then 4k 5 n and thus k I log n/log 4 5 1.4404 log n.”
§ Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms > 2. Fibonacci Heaps
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized time and all other standard heap operations in o( 1) amortized time.”
- Also stated in: § 1. Introduction · plain
“F-heaps support delete min and delete in O(log n) amortized time, and all the other heap operations, in particular decrease key, in 0( 1) amortized time.”
- Also stated in: § 2. Fibonacci Heaps · plain
“THEOREM 1. Zf we begin with no F-heaps and perform an arbitrary sequence of F-heap operations, then the total time is at most the total amortized time, where the amortized time is O(log n) for each delete min or delete operation and 0( 1) for each of the other operations.”
§ Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms > Abstract
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on 2 assumptions not shown here.
- Also stated in: § 1. Introduction · plain
40 more claims
Create a free account to see all 74 claims and every source verdict.
- It may state two separate claims as one. 20
- Probably not a substantial claim. 15
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms > 5. Minimum Spanning Trees
“Another recent major result is an improvement by Gabow, Gal& and Spencer [9] to our minimum spanning tree algorithm of Section 4.”
§ Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms > 1. Introduction
“In Section 4 we use F-heaps to implement Dijkstra's algorithm.In Section 5 we discuss the minimum spanning tree problem.”
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Self-citationEfficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
On the History of the Minimum Spanning Tree Problem
Graham, R. L., & Hell, P. (1985) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1985.10011 · Cited by 813
A quick method for finding shortest pairs of disjoint paths
Suurballe, J. W., & Tarjan, R. E. (1984) · Networks · doi:10.1002/net.3230140209 · Cited by 784
Self-citationAn analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (2009) · Fundamental Problems in Computing · doi:10.1007/978-1-4020-9688-4_3 · Cited by 772
Research works printed but not linked: 6
- GABOW H. N., 1984, Proceedings of the 25th Annual IEEE Symposium on Foundations of Computing. (Singer Island, Fla., Oct. 24-26), 338
- JARNIK V., 1930, Prdca Moravskb PT'irodovbdeckb Spoleknosti, 6, 57
- KN H, D, 1973, Mass.
- KOMLOS J., 1984, Proceedings of the 25th Annual IEEE Symposium on Foundations of Computing. (Singer Island, Fla., Oct. 24-26), 201
- PRIM R.C., 1957, Syst. Tech. ~, 36, 6
- TARJAN R. E., 1983, Pa.
Cited by
Items 3,101–3,140 of 3,140
Matsuda, H., & Homma, S. (2026) · doi:10.31223/x5d216
The Throughput Gain of Hypercycle-level Resource Reservation for Time-Triggered Communication
Wang, P., Sourav, S., Chen, B., Li, H., Wang, F., & Zhang, F. (2026) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2026.3727381
On the Instance Optimality of Bidirectional Dijkstra's AlgorithmPreprint
Požar, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.26952
Dynamic Arity Adjustment for Efficient d-ary Heaps
Lee, S. (2026) · KSII Transactions on Internet and Information Systems · doi:10.3837/tiis.2026.08.016
X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs
Fan, D., Zhang, S., Lee, R., Guo, H., & Zhang, X. (2026) · Proceedings of the VLDB Endowment · doi:10.14778/3828612.3828621
Nav-Index: A High-Performance, Adaptive Index for Shortest Path Queries in RDBMS
Reif, M., & Neumann, T. (2026) · Proceedings of the VLDB Endowment · doi:10.14778/3836663.3836693
A Faster Undirected Single-Source Shortest Path AlgorithmPreprint
Kadria, A., & Roditty, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.15247
Efficient Optimization of Fixed-Length Paths
Ciaperoni, M., Tziavelis, N., & Karras, P. (2026) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2026/245
Finding the shortest path in a simple connected graph
Iglič, M. (2026) · Repository of the University of Ljubljana (University of Ljubljana)
Local Representatives and Shortest Completions for Next-to-Shortest Paths in Directed GraphsPreprint
Li, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.22940
A Coalgebraic Dijkstra Algorithm (Invited Talk)
Sanada, T., Montacute, Y., Phalakarn, K., & Hasuo, I. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.concur.2026.5
An Algorithm for Linear Parametric Minimum Cycle Mean ProblemPreprint
Nishida, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.29234
A path resilience model for hazardous materials routing evaluation
Khan, M. A., & Mehran, B. (2026) · Sustainability Analytics and Modeling · doi:10.1016/j.samod.2026.100084
Making Grid Beam Search Less GreedyPreprint
Papay, S., & Klinger, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.39368
Durand, A. (2024) · Espace ÉTS (ETS)
Shortest Route for Electric Vehicle Routing Problem Using Branch and Cut Algorithm
Ikhwan, H., & Kamardan, M. G. (2026) · Enhanced Knowledge in Sciences and Technology
Sandur, A. (2022) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Distances on rankings: from social choice to flash memories
Hassanzadeh, F. (2013) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
An Efficient Algorithm for the Quickest Path Reliability ProblemPreprint
Forghani-elahabad, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.09175
Principles and Applications of Dijkstra Algorithm
Cherian, J., & Adke, P. (2026) · Springer eBooks · doi:10.1007/978-981-96-8165-5_15-1
Minimum Spanning Tree Algorithms on Large Scale Random Networks
Leiva, N. A. G. (2026) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-032-42320-7_25
Applying Hybrid Computational Intelligence Techniques for Path Planning of Mobile Robots
Lonklang, A. (2026) · ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University) · doi:10.15476/elte.2026.029
Paturu, D. (2026) · Research Square · doi:10.21203/rs.3.rs-11566676/v1
Faster Algorithms for Disjoint Paths in DAGs and Two Disjoint Shortest PathsPreprint
Cao, Y., Qi, H., & Wang, H. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.02154
Goudarzi, H. T., Goodarzi, A. T., & Eshraghi, M. A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.00146
Differentially Oblivious Priority Queues with Sublogarithmic CostPreprint
Guo, Z., Hong, C., & Li, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.04776
Minimum-Cost $k$-Arborescence Packing in $\tilde O(km+k^4 n)$ TimePreprint
Zhou, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.08256
Morales, F. C., Menchaca-Rivera, J. A., Quijano, M., Riascos, H., & Duque, J. S. (2026) · Journal of Applied Physics · doi:10.1063/5.0350129
Verification of Costless Merge Pairing Heaps
Hook, J. V. (2014) · Journal of Undergraduate Research at Minnesota State University Mankato · doi:10.56816/2378-6949.1044
Efficient Algorithms for Single Link Failure Recovery and Its Application To Atm Networks
Bhosle, A. M., & Gonzalez, T. F. (n.d.)
Algorithmes pour le problème de l'arbre couvrant minimal
Chance, E. L. (2014) · Constellation (Université du Québec à Chicoutimi)
Even, G. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139015165.011
Shortest Path Trajectory System Based on Dijkstra Algorithm
Putri, I. P. (2012) · UUM Electronic Theses and Dissertation [eTheses] (Northern University of Malaysia)
Near-Shortest and K-Shortest Simple Paths, Draft
Wood, R. K., & Carlyle, W. M. (2003)
On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version)
Djidjev, H. N., Pantziou, G. E., & Zaroliagis, C. (1994) · MPG.PuRe (Max Planck Society)
Aufspannende Bäume und Arboreszenzen
Körte, B., & Vygen, J. (2012) · Springer eBooks · doi:10.1007/978-3-642-25401-7_6
An optimal data association method based on the minimum weighted bipartite perfect matching
Zhang, X., Rad, A. B., Huang, G. P., & Wong, Y. K. (2015) · Autonomous Robots · doi:10.1007/s10514-015-9439-y
The Optimal Rescue Path Set Problem in Undirected Graphs
Zhang, H., & Xu, Y. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38756-2_14
Metadata
- Authors
- Fredman, M. L., & Tarjan, R. E.
- Affiliations
- University of California San Diego (US)
- AT&T (United States) (US)
- ORCID
- Tarjan, Robert Endre
- Venue
- Journal of the ACM
- Published
- 1987-07
- Volume
- 34
- Issue
- 3
- Pages
- 596-615
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2084224084
- Semantic Scholar
- 93e12a891485806085ad95d4144a21a55d7fc996
- Cited by
- 3,132
- References
- 32
- Citations by year
- 2026: 114 · 2025: 91 · 2024: 99 · 2023: 91 · 2022: 88 · 2021: 108 · 2020: 101 · 2019: 148 · 2018: 147 · 2017: 128 · 2016: 119 · 2015: 122 · 2014: 153 · 2013: 154 · 2012: 125
- FWCI
- 30.17
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Journal of the ACM (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Keywords
- Fibonacci heaps, priority queues, amortized time complexity, single-source shortest path, all-pairs shortest paths, assignment problem, weighted bipartite matching, minimum spanning tree, network optimization algorithms, graph algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-11-17, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-11-17 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.