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 2,201–2,300 of 3,140
Random models and heuristic algorithms for correlation clustering problems on signed social networks
Wahid, D. F. (2017) · cIRcle (University of British Columbia) · doi:10.14288/1.0347257 · Cited by 2
Aspectos de redes complexas com aplicações em neurociência
da Rocha, W. A. A. (2017) · doi:10.47749/t/unicamp.2017.985546 · Cited by 2
Multicriteria pathfinding in uncertain simulated environments
Buck, A. R. (2018) · MOspace Institutional Repository (University of Missouri) · doi:10.32469/10355/66141 · Cited by 2
Development of an Obstacle Detection and Avoidance System for ROV
Grefstad, Ø. (2018) · NORA - Norwegian Open Research Archives · Cited by 2
Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path ProblemPreprint
Garg, V. K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.10499 · Cited by 2
Multiscale shortest path algorithm for big-size utility networksPreprint
Giudicianni, C., Nardo, A. D., Scala, A., & Herrera, M. (2019) · arXiv (Cornell University) · Cited by 2
Procedural Generation of Dungeon Maps, Missions and Rooms
Pereira, L. T. (2019) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.55.2019.tde-25032019-144917 · Cited by 2
Density Independent Algorithms for Sparsifying $k$-Step Random WalksPreprint
Jindal, G., Kolev, P., Peng, R., & Sawlani, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.06110 · Cited by 2
Parallel Shortest-Paths Using Radius SteppingPreprint
Blelloch, G. E., Gu, Y., Sun, Y., & Tangwongsan, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.03881 · Cited by 2
Separating Hierarchical and General Hub LabelingsPreprint
Goldberg, A. V., Razenshteyn, I., & Savchenko, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.5973 · Cited by 2
Concave Generalized Flows with Applications to Market EquilibriaPreprint
Végh, L. A. (2011) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.1109.3893 · Cited by 2
Steiner Point Removal with distortion $O(\log k)$, using the Noisy-Voronoi algorithmPreprint
Filtser, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.02800 · Cited by 2
Essays on misallocation of production inputs and energy efficiency in Indian industries
Singer, G. (2019) · London School of Economics and Political Science Theses Online (London School of Economics and Political Science) · Cited by 2
Improved approximation ratios for two Euclidean maximum spanning tree problemsPreprint
Biniaz, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.03870 · Cited by 2
Lazy Search TreesPreprint
Sandlund, B., & Wild, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.08840 · Cited by 2
A formal correctness proof of Boruvka's minimum spanning tree algorithm.
Robinson-O’Brien, N. (2020) · University of Canterbury Research Repository (University of Canterbury) · doi:10.26021/10196 · Cited by 2
Monocular autonomous exploration in unknown environment with low cost quadrotor
Fossati, S., & Iasella, D. (2013) · Cited by 2
Multiplicity in the Partitioning of Signed Graphs
Arınık, N. (2021) · theses.fr (ABES) · doi:10.70675/b26cda86zeec4z4f9dza051z3b920fcfee10 · Cited by 2
The computational problems of using OWA operators
Cutello, V., & Montero, J. (1995) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 2
Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding
Zhou, X. (2014) · doi:10.13021/mars/4533 · Cited by 2
A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per InsertionPreprint
Sinnamon, C., & Tarjan, R. E. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.11791 · Cited by 2
Self-citationAn $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matchingPreprint
Rajabi-Alni, F., & Bidgoli, B. M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.3408 · Cited by 2
Depth-First Grover Search Algorithm on Hybrid Quantum-Classical ComputerPreprint
Guo, H. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2210.04664 · Cited by 2
Single-Source Shortest Paths with Negative Real Weights in $\tilde{O}(mn^{8/9})$ TimePreprint
Fineman, J. T. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2311.02520 · Cited by 2
Bayesian data fusion for distributed learning
Wu, P. (2024) · Digital Repository Service (Northeastern University) · doi:10.17760/d20659818 · Cited by 2
Breaking the Bellman-Ford Shortest-Path BoundPreprint
Elmasry, A. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2410.23383 · Cited by 2
Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Unsatisfied ProbabilitiesPreprint
Jia, C., Chang, D., Wang, R., Wang, G., Yan, G., & Qu, C. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2506.13507 · Cited by 2
Optimization Algorithms for the Flight Planning Problem
Blanco, M. (2023) · doi:10.17169/refubium-40665 · Cited by 2
Applications of matching theory in constraint programming
Cymer, R. (2013) · Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover) · doi:10.15488/8031 · Cited by 2
OASIcs, Volume 75, ATMOS'19, Complete Volume
Cacchiani, V., & Marchetti-Spaccamela, A. (2019) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.atmos.2019 · Cited by 2
Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density
Blumenstock, M. (2020) · Gutenberg Open Science · doi:10.25358/openscience-3596 · Cited by 2
New Applications of the Nearest-Neighbor Chain Algorithm
Mamano Grande, N. (2019) · eScholarship (California Digital Library) · Cited by 2
Design space exploration for the development of embedded systems
Holzer, M. (2008) · reposiTUm (TU Wien) · Cited by 2
BMSSPy: A Python Package and Empirical Comparison of Bounded Multi-Source Shortest Path AlgorithmPreprint
Makowski, C., Guter, W., Russell, T., & Saragih, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5777186 · Cited by 2
A Faster Directed Single-Source Shortest Path AlgorithmPreprint
Duan, R., Mao, X., Shu, X., & Yin, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.07868 · Cited by 2
Beyond a Single Queue: Multi-Level-Multi-Queue as an Effective Design for SSSP problems on GPUsPreprint
Hu, Z., Sun, J., Jiang, L., Wang, Y., Lin, J., Zong, Y., & Sun, G. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.10080 · Cited by 2
Universally Optimal Decremental Tree MinimaPreprint
Berendsohn, B. A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.15977 · Cited by 2
Curvilinear Structures Segmentation and Tracking in Interventional Imaging
Honnorat, N. (2013) · theses.fr (ABES) · doi:10.70675/cedd9e2czaff5z4f29zaab0zebc3a428e62c · Cited by 2
Abdollahi, N. (2021) · theses.fr (ABES) · doi:10.70675/c6cdfbd1z275az47e7zaad9z136a5099a065 · Cited by 2
Stochastic Online Euclidean TSPPreprint
Hermansen, D. A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.07537 · Cited by 2
Contributions to the Resilience Management in the Internet of Things
Huang, Y. (2015) · UPM Digital Archive (Technical University of Madrid) · doi:10.20868/upm.thesis.37209 · Cited by 2
Finding Maximal Pairs with Bounded Gap
Brodal, G. S., Lyngsø, R. B., Pedersen, C. N. S., & Stoye, J. (1999) · BRICS Report Series · doi:10.7146/brics.v6i12.20069 · Cited by 1
Testing Whether a Subgraph Is Convex or Isometric
Cabello, S. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.wads.2025.12 · Cited by 1
User interactive object extraction with sequential image segmentation
Sağlam, A., & Baykan, N. A. (2018) · Signal Processing and Communications Applications Conference (SIU) · doi:10.1109/siu.2018.8404215 · Cited by 1
A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
Omer, J., & Poss, M. (2020) · Networks · doi:10.1002/net.21994 · Cited by 1
Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
de Verdière, É. C., & Schrijver, A. (2008) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2008.1347 · Cited by 1
An Algorithm for the All-pair Shortest Path Problem on Circular Trapezoid Graphs
Honma, H., Nakajima, Y., Urangoo, T., & Tamori, Y. (2020) · Journal of Engineering and Digital Technology (JEDT) · Cited by 1
Mahboubi, H., Asadi, M. M., Blouin, S., & Aghdam, A. G. (2022) · IEEE Access · doi:10.1109/access.2022.3175425 · Cited by 1
Bairamkulov, R., & Friedman, E. G. (2022) · Springer eBooks · doi:10.1007/978-3-031-11047-4_2 · Cited by 1
Learning to Predict Shortest Path Distance
Qu, Z., Zong, Z., & Zhang, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-46671-7_20 · Cited by 1
An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
Bandyapadhyay, S., & Xue, J. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.socg.2024.12 · Cited by 1
Explaining results of path queries on graphs: Single-path results for context-free path queries
Hellings, J. (2024) · Information Systems · doi:10.1016/j.is.2024.102475 · Cited by 1
Revisiting the Bus Stop Problem in Road Networks
Proissl, C., & Koch, D. (2024) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/3678717.3691314 · Cited by 1
Some results on linear recurrence sequences and applications to matrices
Zriaa, S., & Mouçouf, M. (2024) · Rendiconti del Circolo Matematico di Palermo Series 2 · doi:10.1007/s12215-024-01143-y · Cited by 1
Rapidly Computing Approximate Graph Convex Hulls via FastMap
Li, A., Stuckey, P. J., Koenig, S., & Kumar, T. K. S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-82484-5_24 · Cited by 1
Erbil, M. E., Özkahraman, M., & BAYRAKÇI, H. C. (2025) · Fırat Üniversitesi Mühendislik Bilimleri Dergisi · doi:10.35234/fumbd.1518386 · Cited by 1
Computation of lower tolerances of combinatorial bottleneck problems
Jäger, G., & Turkensteen, M. (2025) · Discrete Optimization · doi:10.1016/j.disopt.2025.100887 · Cited by 1
Hyb-Stepping: Hybrid Stepping for Parallel Shortest Paths
Gargary, A. V., & Fuad, S. (2025) · doi:10.1145/3711708.3723447 · Cited by 1
On the combination of altimetry and tide gauge observations in the Norwegian coastal zone
Mysen, E., & Breili, K. (2025) · Journal of Geodetic Science · doi:10.1515/jogs-2025-0184 · Cited by 1
Mor, B., Mosheiov, G., & Shabtay, D. (2025) · Journal of Scheduling · doi:10.1007/s10951-025-00848-x · Cited by 1
Forward-Secure Multi-User Graph Searchable Encryption for Exact Shortest Path Queries
Wang, W., Fan, Q., Zhang, C., Zuo, C., & Zhu, L. (2025) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2025.3599412 · Cited by 1
An algorithm for Direct Construction of all Pareto Optimal Biobjective Minimum Spanning Trees
Laskov, L. M., & Marinov, M. L. (2025) · Annals of Computer Science and Information Systems · doi:10.15439/2025f5317 · Cited by 1
An Efficient and Versatile Approach to Shortest Path Problems in Interprocedural Programs
Pinto, T. D. C., Rollet, A., & Sutre, G. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-06847-7_3 · Cited by 1
When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
Bentert, M., Fomin, F. V., Golovach, P. A., Ramanujan, M. S., & Saurabh, S. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.socg.2025.15 · Cited by 1
Optimal Multimarginal Schrödinger Bridge: Minimum Spanning Tree Over Measure-Valued Vertices
Bondar, G. A., & Halder, A. (2025) · IEEE Control Systems Letters · doi:10.1109/lcsys.2025.3634944 · Cited by 1
Rysgaard, C. M., & Wild, S. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2025.87 · Cited by 1
Distributed Dynamic Associative Memory via Online Convex Optimization
Wang, B., Zecchin, M., & Simeone, O. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3739741 · Cited by 1
A Fast Linearithmic Graph Clustering Approach for Big Data Using Gravitational Attraction Principle
Akhter, M. M., Khan, A. A., Maheshwari, R., & Mohanty, S. K. (2025) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2025.3639917 · Cited by 1
Fast Optimal Group Steiner Tree Search using GPUs
Li, J., Sun, Y., Ma, B., Chen, L.-C., Hu, M., Zhang, F., & Li, R.-H. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3769792 · Cited by 1
Combinatorial Semi-Bandit Methods for Navigation of Electric Vehicles
Åkerblom, N. (2024) · Chalmers Research (Chalmers University of Technology) · Cited by 1
External-Memory Priority Queues with Optimal Insertions
Brodal, G. S., Goodrich, M. T., Iacono, J., Lo, J. J. T. L., Meyer, U., Pagan, V., Sitchinava, N., & Svenning, R. (2025) · Leibniz international proceedings in informatics · doi:10.4230/lipics.esa.2025.5 · Cited by 1
Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP
Karczmarz, A., Nadara, W., & Sokołowski, M. (2026) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978971.214 · Cited by 1
From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
Dadush, D., Orlin, J. B., Sidford, A., & Végh, L. A. (2026) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978971.7 · Cited by 1
Mishra, R., Mousavi, M., Nelson, A. A., & Jarrahbashi, D. (2026) · Fuel · doi:10.1016/j.fuel.2026.138379 · Cited by 1
ParallelGSE: Efficient and Secure Shortest Path Search on Encrypted Graphs
Fan, Q., Wang, W., Zhang, C., Guan, Z., Xie, Y., Lu, M., & Zhu, L. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3664315 · Cited by 1
Complete Pareto Front of the Biobjective Minimum Length Minimum Risk Spanning Trees Problem
Laskov, L. M., & Marinov, M. L. (2026) · Studies in computational intelligence · doi:10.1007/978-3-032-05711-2_7 · Cited by 1
Peng, C., Chen, J., Huang, Y., & Yang, Z. (2026) · Communications in Mathematics and Statistics · doi:10.1007/s40304-025-00468-z · Cited by 1
Shortest path tree-based algorithm for efficient resilience measures
Cerqueti, R., Iovanella, A., & Scozzari, A. (2026) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2026.131433 · Cited by 1
Cost-Free Neutrality for the River Method
Döring, M., Malanowski, J., & Neubert, S. (2026) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v40i20.38728 · Cited by 1
A Lasso‐Alternative to Dijkstra's Algorithm for Identifying Short Paths in Networks
Dong, A., Taghvaei, A., & Georgiou, T. T. (2026) · Networks · doi:10.1002/net.70035 · Cited by 1
Kitthiphovanonth, W., Chaikittiporn, C., Ketsakorn, A., & Puangnak, K. (2026) · Applied Sciences · doi:10.3390/app16073434 · Cited by 1
Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines
van der Hoog, I., Iacono, J., Rotenberg, E., & Rutschmann, D. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2026.45 · Cited by 1
Warm-Starting All-Pairs Shortest Paths with Predictions
Polak, A., & Schmidt, J. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2026.62 · Cited by 1
Oblivious Priority Queue and Single-Source Shortest Path in the External Memory Setting
Maheshwari, A., & Shi, E. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35418-1_11 · Cited by 1
Efficient Merge and Insert Operations for Binary Heaps and Trees
Kuszmaul, C. L., & Woo, A. (2000) · NASA Technical Reports Server (NASA) · Cited by 1
Impact of heuristics in clustering large biological networks
Shafin, K., Kabir, K. L., Ridwan, I., Anannya, T. T., Karim, R. S., Hoque, M. M., & Rahman, M. S. (2015) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2015.05.007 · Cited by 1
Strategic deployment in graphs
Langetepe, E., Lenerz, A., & Brüggemann, B. (2014) · Informatica · doi:10.48550/arxiv.1412.0538 · Cited by 1
Hendling, K., Franzl, G., Statovci-Halimi, B., & Halimi, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25969-5_30 · Cited by 1
Zhang, T., Guo, B., & Tan, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24918-1_17 · Cited by 1
Establishing semantic closeness in an agent-based travel support system
Mesjasz, M. M., Paprzycki, M., & Ganzha, M. (2013) · Scalable Computing Practice and Experience · doi:10.12694/scpe.v14i2.844 · Cited by 1
Designing and Implementation of High Concurrent SSL VPN Server
Chu, J. (2012) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.241-244.2424 · Cited by 1
Yet another efficient algorithm for replacing the edges of a minimum spanning tree
Kooshesh, A. A., & Crawford, R. R. (1996) · ACM Annual Conference on Computer Science (CSC) · doi:10.1145/228329.228337 · Cited by 1
Fast algorithms for placing large entries along the diagonal of a sparse matrix
Kundeti, V. K., & Rajasekaran, S. (2010) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2010.07.002 · Cited by 1
Yang, H. (2013) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.409-410.1415 · Cited by 1
The number of tests required to search an unordered table
Fredman, M. L. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(03)00260-6 · Cited by 1
Self-citationJohari, S. S., & Ojha, A. (2013) · IEEE International Advance Computing Conference · doi:10.1109/iadcc.2013.6514458 · Cited by 1
System reliability for joint minimal paths under time constraint
Lin, Y., Kuo, P.-H., & Chang, C.-C. (2012) · Journal of the Chinese Institute of Engineers · doi:10.1080/02533839.2012.747250 · Cited by 1
An approach to automatical semantic analysis of Web query interfaces
Liang, H., Shao, Z., & Sun, X. (2011) · IEEE International Conference on Communication Software and Networks · doi:10.1109/iccsn.2011.6014029 · Cited by 1
Effective keyword query processing with an extended answer structure in large graph databases
Park, C.-S., & Lim, S. (2014) · International Journal of Web Information Systems · doi:10.1108/ijwis-11-2013-0030 · Cited by 1
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.