The DOI matches its Crossref record.
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
Abstract
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 0(log n) amortized time and all other standard heap operations in 0(1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Gabow, H. N., Galil, Z., Spencer, T., & Tarjan, R. E. (1986) · Combinatorica · doi:10.1007/bf02579168 · Cited by 517
Self-citationMultiresolution Priority Queues
Ros-Giralt, J., Commike, A., Cullen, P., Lucovsky, J., Madathil, D., & Lethin, R. (2017) · arXiv · Cited by 3
Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes
Gu, S., & Soleimanifar, M. (2025) · arXiv · doi:10.48550/arxiv.2508.04769 · Cited by 2
Metadata
- Authors
- Fredman, M. L., & Tarjan, R. E.
- Venue
- 25th Annual Symposium onFoundations of Computer Science, 1984.
- Publisher
- IEEE
- Published
- 2005-08-24
- Pages
- 338-346
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2163169902
- Cited by
- 247
- References
- 0
- FWCI
- 2.12
- Type
- conference paper
- Language
- en
- Open access
- closed
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.
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms. https://app.cochat.ai/papers/10.1109/sfcs.1984.715934
- The paper
- Fredman, M. L., & Tarjan, R. E. (2005). Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms. 25th Annual Symposium onFoundations of Computer Science, 1984. https://doi.org/10.1109/sfcs.1984.715934
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.
