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,001–3,100 of 3,140
Efficiënte algoritmen voor het plannen van chauffeurs met onderlinge afhankelijke ritten
Sulzbach Sartori, C. (2023) · Lirias
Effiziente Algorithmen für ein Fahrplanauskunftsystem
Schulz, F. (2000) · KOPS (University of Konstanz)
Graph-based Estimation of Information Divergence Functions
(2017) · Arizona State University Library Digital Repository (Arizona State University)
Modernien lyhimmän polun algoritmien arviointi Suomen tieverkoissa
Makkonen, J. (2024) · Aaltodoc (Aalto University)
Shortest Path algorithms for the traversal of an Order-5 square tiling from within a confined space
Snellenberg, R. (2023) · Research Repository (Delft University of Technology)
El calendario en la simulación a eventos discretos
Murray, L. (2003) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Najkrajše poti z enim virom v dinamičnih grafih
Prošek, A. (2024) · Repository of the University of Ljubljana (University of Ljubljana)
Optimization tools for electric vehicle consumption
Baouche, F. (2015) · HAL
林哲弘, & Lin, C.-H. (2015) · Institutional Repositories DataBase (IRDB)
Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path AlgorithmsPreprint
Hao, P., & Le, T. D. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2508.12074
Efficient watershed algorithm implementation for large affinity graphs
Zlateski, A. (2011) · DSpace@MIT (Massachusetts Institute of Technology)
Two-phase algorithms for the parametric shortest path problemPreprint
Fischer, E., Lachish, O., & Yuster, R. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.3749
Generalizing the Successive Shortest Path Algorithm to solve the Multi-objective Assignment ProblemPreprint
sedeno-noda, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5701125
Heuristinen yhteistyöhaku ohjelmistoagenttien avulla
Halme, A. (2014) · Aaltodoc (Aalto University)
Huttunen, J. (2014) · Aaltodoc (Aalto University)
GRAPE: Parallelizing Sequential Graph Computations
Fan, W., Xu, J., Wu, Y., Yu, W., & Jiang, J. (2017) · Edinburgh Research Explorer (University of Edinburgh)
Shortest paths in shorter time
Grgurovič, M. (2017) · Repository of the University of Primorsk (University of Primorska)
On interoperability and trajectory analysis of single-cell transcriptomics data
Deconinck, L. (2025) · Ghent University Academic Bibliography (Ghent University)
Efficient algorithms for Lipschitz selections of set-valued mappings in R 2
Shvartsman, P. (2025) · Journal of Approximation Theory · doi:10.1016/j.jat.2025.106277
Wang, H., & Li, C. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6021737
Hybrid Heap Hierarchically Generate Index Sequential Sorted List to Optimize Priority Queue
Amjherawala, F., & Dubey, S. (2026) · Learning and analytics in intelligent systems · doi:10.1007/978-3-032-05377-0_31
Emit As You Go: Enumerating Edges of a Spanning Tree
Casel, K., & Neubert, S. (2025) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/iprl2609
Fair and Efficient Investment in Public TransportationPreprint
Bullinger, M., Elkind, E., & Köck, K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.03687
Fast Sampling for Privacy-Preserving Lazy Multiplicative Weight Update
Li, X., Song, Z., & Zhao, J. (2025) · Proceedings · doi:10.1109/icdm65498.2025.00049
Gerards, A. M. H. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands
A Speculative Hardware Scheduler Supporting Priority Updates
Posluns, G. (2022) · TSpace (University of Toronto)
An Enhanced Tool for Simulating the End-to-End Network Delays of Cyber Physical Systems
Gray, D. M. (2019) · Lehigh Preserve
Polunhakualgoritmit kaksiulotteisessa ruudukossa
Mäkitalo, O. (2024) · Tampere University Institutional Repository (Tampere University)
Kruskal-EDS: Edge Dynamic StratificationPreprint
Mercadier, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.02006
Temporal centralities : a study of the importance of nodes in dynamic graphs
Ghanem, M. (2018) · theses.fr (ABES)
Accelerating Two Minimum Disjoint Paths Algorithm with Learned Predictions
朱, 世. (2026) · Advances in Applied Mathematics · doi:10.12677/aam.2026.153096
Revisnyei, P., Vass, B., & Pašíć, A. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6357951
Gerichtete Diagnostik von Systemverlässlichkeitsmodellen
Aljazzar, H. (2009) · KOPS (University of Konstanz)
Fast, right or best? Algorithms for practical optimization problems
Feijen, W. (2024) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands
Introduction of Advanced Algorithms in Software Engineering: A Computational Theory View
Nazar, S. (2025) · GlobeIS International Journal of Global Information Systems · doi:10.66395/globeis.5
Efficient quantum communication protocols and asynchronism in the toric code
Diniz, J. F. D. (2021) · Bristol Research (University of Bristol)
Deveci, K. (2018) · Istanbul Technical University Academic Open Archive (Istanbul Technical University)
Bozpolat, S. A., & Salehi, Ö. (2026) · International Journal of Advances in Engineering and Pure Sciences · doi:10.7240/jeps.1752589
On the use of network coding and multicast for enhancing performance in wired networks
Wang, Y. (2013) · theses.fr (ABES) · doi:10.70675/9023f0b1z6061z4771z8299z86213f6e0ec0
Qualité de service et calcul de chemins dans les réseaux inter-domaine et multicouches
Lamali, M. L. (2014) · theses.fr (ABES) · doi:10.70675/4618df6az4f5az4bc9zb65az739cce1df0b6
Optimisation et intégration de la mobilité partagée dans les systèmes de transport multimodaux
Aissat, K. (2016) · theses.fr (ABES) · doi:10.70675/93bf8a1fzc106z4fd1z841bza55f2c05723c
Graph Iterative Filtering methods for the analysis of nonstationary signals on graphsPreprint
Scarlato, G., Cicone, A., & Donatelli, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.29920
Managing recommendation data in large scale
Guèye, M. (2014) · theses.fr (ABES) · doi:10.70675/56c3fa7bzeb51z438cz9ccez398a7309d9bb
Large-scale data management in real-world graphs
Dhia, I. B. (2013) · theses.fr (ABES) · doi:10.70675/8f2473f4z0e53z4ab4z85bbzf70acd80fde8
Algorithmes pour un guidage optimal des usagers dans les réseaux de transport
Manseur, F. (2017) · theses.fr (ABES) · doi:10.70675/47d70f66zed94z4f42zb187z572cc07da591
Fixed charge network design problem with user-optimal flows
Bouras, I. (2019) · theses.fr (ABES) · doi:10.70675/1baa5af6z20cdz41c8zadeczffa0f5bbfe6b
Mixed sequence-structure based analysis of proteins, with applications to functional annotations
Tetley, R. (2018) · theses.fr (ABES) · doi:10.70675/4fb1ffd2z8125z4a03z99b0za6b6608a5a76
High performance level-set based topological data analysis
Gueunet, C. (2019) · theses.fr (ABES) · doi:10.70675/cc13b938z59a4z41c0zaa4az49184ed82016
Optimisation des réseaux aériens : analyse et sélection de nouveaux marchés
Kamal-Idrissi, A. (2020) · theses.fr (ABES) · doi:10.70675/a20db9e0z999ez4aebzbf6bz348013c46373
Reconfiguration problems in graphs
Ouvrard, P. (2021) · theses.fr (ABES) · doi:10.70675/81cccf81zb873z4003za275zb21b3505db2e
Production planning and scheduling problems under energy aspects
Aghelinejad, M. M. (2018) · theses.fr (ABES) · doi:10.70675/dbeab839z50fcz4bd3za65dz06019b4d68a8
Recherche de plus court chemin multimodal de point à point dépendant du temps
Finkelstein, A. (2022) · theses.fr (ABES) · doi:10.70675/e0752e32z8571z4b23z9b24z9b095c4313f7
Étude numérique du point critique de systèmes quantiques de spin désordonnés en dimensions élevées
Anfray, V. (2022) · theses.fr (ABES) · doi:10.70675/4b5cad3fz3b40z4cf0z8c51z5d753b45a51c
Edelkamp, S. (2026) · doi:10.1515/9783111386690-003
SimdQuickHeap: The QuickHeap Reconsidered
Breitling, J., Koerkamp, R. G., & Williams, M. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2026.16
A post-optimizer for the Maximally Diverse Grouping Problem
Schulz, A. (2026) · European Journal of Operational Research · doi:10.1016/j.ejor.2026.05.004
Autonomous Exploration Planning using Directed Single-Source Shortest Paths
Xavier, F. C. S., Santos, S. R. B. D., & Givigi, S. N. (2026) · IEEE International Systems Conference (SysCon) · doi:10.1109/syscon66367.2026.11503538
Tan, R. K., Mert, O., Demirel, Y., & Orhan, Ö. (2026) · Black Sea Journal of Engineering and Science · doi:10.34248/bsengineering.1802318
Geometric optimization of wildlife corridors on grid-based landscapes using integer programming
Wang, C., Sefair, J. A., & Fletcher, R. J. (2026) · European Journal of Operational Research · doi:10.1016/j.ejor.2026.05.012
Kreczman, S. (2026) · ORBi (University of Liège)
Shortest paths in planar domains with hyperbolic type metrics
Gao, S., Hakanen, A., Rasila, A., & Вуоринен, М. (2026) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2026.130801
Concise representations and complexity results for welfare-maximizing combinatorial assignment
Präntare, F., Eriksson, L., Osipov, G., Heintz, F., & Jonsson, P. (2026) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-026-09753-9
Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
Xiao, W., Besançon, M., Gelß, P., Hendrych, D., Klus, S., & Pokutta, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-27242-3_36
Zhao, L., Chang, H., Yang, P., Li, H., & Zhou, L. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.133137
Comparison of algorithms for finding the shortest path in a graph
Golob, L. (2026) · Repository of the University of Ljubljana (University of Ljubljana)
Exact Subquadratic Algorithm for Many-To-Many Matching on Planar Point Sets with Integer Coordinates
Park, S., & Oh, E. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.swat.2026.36
Mikler, A. R., Tiwari, C., & Patterson, M. (2026) · Algorithms · doi:10.3390/a19060475
ClusterGraph: a new tool for visualisation and compression of multidimensional data
Dłotko, P., Gurnari, D., Hallier, M., & Jurek, A. (2026) · GigaScience · doi:10.1093/gigascience/giag070
A multirobot system for autonomous crop field scouting: System integration and demonstration
Wei, Y., Johnson, J., Bagavathiannan, M., & Lee, K. (2026) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2026.112016
An Entropy Potential for Type-Composition GamesPreprint
Alimi, M., de la Haye, M., Lenzner, P., Schierreich, Š., Skopalik, A., & Wunderlich, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.14428
Clarity and Computational Efficiency of Orbital Boundary Labeling
Wallinger, M., Bonerath, A., Terziadis, S., Wulms, J., & Nöllenburg, M. (2026) · IEEE Pacific Visualization Conference (PacificVis) · doi:10.1109/pacificvis68791.2026.00005
Statistical and Structural Approaches to Algorithmic FairnessPreprint
Ferrara, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.26200
Almost Optimal Multiple Source Shortest Paths and ReachabilityPreprint
Saha, B., Xu, Y., & Ye, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.26554
Limit of Ratio of Terms along Arithmetic Progressions in Linear Recurrence Sequences
Charlier, E., & Kreczman, S. (2026) · Uniform distribution theory · doi:10.66833/udt-2026-0011
Yuan, X., Yang, X., & An, D. (2026) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2026.0170676
A Distributed Memory 1/2 Approximation Algorithm for Vertex-Weighted Matching
Alotaibi, S. (2024) · Research Publication Repository of King Fahd University of Petroleum and Minerals (King Fahd University of Petroleum and Minerals)
Towards improved task scheduling incloud computing plataforms
Gaibor, E. B. (2022) · Maestría en Control de Operaciones y Gestión Logística (Escuela Superior Politécnica del Litoral)
GPU-Parallel Alternatives for Traffic Assignment
Pishchev, P., & Yarmoshik, D. V. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-31390-4_26
Ramos, A., Hulak, D. B., & de Queiroz, R. (2026) · Research Square · doi:10.21203/rs.3.rs-10206880/v1
Brief Announcement: QPID: A Scalable, Strict Concurrent Priority Queue
Grimes, O., Rodriguez, M., Hassan, A., Spear, M., & Palmieri, R. (2026) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3816782.3819208
Laskov, L. M., & Marinov, M. L. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22221-3_26
Kashikar, A. (2026) · Springer eBooks · doi:10.1007/978-981-96-8165-5_290-1
Tight Bounds for $(1+ε)$-Approximation for Minimum Spanning Trees in Doubling MetricsPreprint
Höckendorff, J., Hommelsheim, F., Sohler, C., & Yue, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.13284
Li, R., & Su, X. (2026) · Mathematics · doi:10.3390/math14142567
Pure Pairing HeapsPreprint
Tarjan, R. E., & Xu, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.23118
Self-citationAnálise assintótica e empírica de filas de prioridade avançadas aplicadas ao Algoritmo de Dijkstra
Fernandes, A. C., Castro, L., Clementino, T., & de Freitas, R. (2026) · doi:10.5753/etc.2026.22057
K, V. M., & Pawar, D. T. (2026) · International Research Journal on Advanced Engineering and Management (IRJAEM) · doi:10.47392/irjaem.2026.0379
${\sf S}$-${\sf Leak}$: Practical Leakage-Abuse Attack Against Conjunctive SSE in Cloud Storage
Su, Y., Shen, M., Zuo, C., Li, Q., Liu, Y., Wang, W., Xie, Y., & Zhu, L. (2026) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2026.3721360
Stochastic Gradient Meets Randomized Rounding: New Algorithms for Node-Weighted Steiner ProblemsPreprint
Koutsoutis, J., Lerner, J., Levin, R., & Yu, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.06807
The Sync Heap: Delete First, Ask Questions LaterPreprint
Berendsohn, B. A., Gorbachev, E., & Kozma, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.07134
Reverse K Nearest Neighbor Query in Large Road Networks: a Tree Decomposition Based Approach
Ouyang, D., Zhang, B., Yang, J., Yang, S., Wang, C., & Lin, X. (2026) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde65706.2026.00049
Single Source Shortest Paths in Randomized Two-Dimensional Mesh Networks
Sun, S., Sang, Y., & Fu, Z.-H. (2026) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet65726.2026.11632844
Open List Implementations in A*
Christen, R., Pommerening, F., & Helmert, M. (2026) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v19i1.43090
Fernandes, A. C., Miranda, R., & de Freitas, R. (2026) · Anais do Workshop em Desempenho de Sistemas Computacionais e de Comunicação (WPerformance) · doi:10.5753/wperformance.2026.23674
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.