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,001–2,100 of 3,140
Tarapata, Z. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12101-2_39 · Cited by 3
Simpler Computation of Single-Source Shortest Paths in Linear Average Time
Hagerup, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24749-4_32 · Cited by 3
Elmasry, A., Jensen, C., & Katajainen, J. (2006) · Lecture notes in computer science · doi:10.1007/11940128_32 · Cited by 3
Low-cost fault-tolerant spanning graphs for point sets in the Euclidean plane
Nardelli, E., Stege, U., & Widmayer, P. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-006651988 · Cited by 3
The set union problem with dynamic weighted backtracking
Gambosi, G., Italiano, G. F., & Talamo, M. (1991) · BIT Numerical Mathematics · doi:10.1007/bf01933257 · Cited by 3
An efficient parallel algorithm for shortest paths in planar layered digraphs
Mishra, P. K. (2004) · Journal of Zhejiang University. Science A · doi:10.1631/jzus.2004.0518 · Cited by 3
An approximate algorithm for the minimal vertex nested polygon problem
Dasgupta, B., & Madhavan, C. E. V. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90185-3 · Cited by 3
A top down unification of minimum cost spanning tree algorithms
Merritt, S. M. (1989) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/75246.75259 · Cited by 3
Directed single-source shortest-paths in linear average-case time
Meyer, U. (2001) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3
LEDA-SM: External Memory Algorithms and Data Structures in theory and practice
Crauser, A. (2001) · Max Planck Institute for Plasma Physics · doi:10.22028/d291-25687 · Cited by 3
On multicasting in a communication network
Makki, K., Pissinou, N., & Frieder, O. (2002) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.1995.540186 · Cited by 3
Fast data structures for shortest path routing: a comparative evaluation
Oberhauser, G., & Simha, R. (2002) · International Conference on Communications · doi:10.1109/icc.1995.524471 · Cited by 3
Algorithms for Path Problems in Weighted Graphs
Williams, V. V. (2008) · Cited by 3
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs
Mozes, S. (2013) · doi:10.7301/z0hd7t0f · Cited by 3
Approximating multi-commodity max-flow in practice
Emanuelsson, K. (2016) · DiVA (Digitala Vetenskapliga Arkivet) · Cited by 3
Worst Case Efficient Data Structures
Brodal, G. S. (1997) · Cited by 3
Finding the Most Vital Edges for Shortest Paths: Algorithms and Complexity for Special Graph Classes
Stahlberg, M. (2016) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.6106753 · Cited by 3
Modifying Dijkstra's Algorithm to Solve Many Instances of SSSP in Linear Time
Otte, M. (2015) · CU Scholar (University of Colorado Boulder) · Cited by 3
Weiss, A. (2013) · TSpace (University of Toronto) · Cited by 3
Translations on graphs with neighborhood preservation.Preprint
Pasdeloup, B., Gripon, V., Grelier, N., Vialatte, J., & Pastor, D. (2017) · arXiv (Cornell University) · Cited by 3
All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix MultiplicationPreprint
Zwick, U. (2000) · arXiv (Cornell University) · Cited by 3
A Lexicographic Search Method for Multi-Objective Motion PlanningPreprint
Shan, T., & Englot, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.02184 · Cited by 3
A Most Irrational Foraging AlgorithmPreprint
Aggarwal, A., Vining, W., Gupta, D., Saia, J., & Moses, M. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.11973 · Cited by 3
Multidimensional Team Formation
Schibler, T., Singh, A. K., & Suri, S. (2019) · eScholarship (California Digital Library) · Cited by 3
Shortest non-separating st-path on chordal graphsPreprint
Mao, X. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.03519 · Cited by 3
Parallel Algorithms for the Assignment and Minimum-Cost Flow Problems
Orlin, J. B., & Stein, C. (1992) · Defense Technical Information Center (DTIC) · doi:10.21236/ada460051 · Cited by 3
Elkin, M., & Neiman, O. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.07572 · Cited by 3
Ujcich, B. E. (2020) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 3
Algoritmos para caminhos mínimos
Isotani, S. (2002) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.45.2002.tde-20210729-125537 · Cited by 3
Path computation enhancement in SDN networks
Huang, T. (2021) · doi:10.32920/ryerson.14643900 · Cited by 3
Etude et conception d'algorithmes pour les réseaux mobiles et ad-hoc
Badis, H. (2005) · HAL · Cited by 3
A Faster External Memory Priority Queue with DecreaseKeysPreprint
Jiang, S., & Larsen, K. G. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.07598 · Cited by 3
Pereira, L. T. (2022) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.55.2022.tde-28032023-091310 · Cited by 3
Fair Core Imputations for the Assignment Game: New Solution Concepts and Efficient AlgorithmsPreprint
Vazirani, V. V. (2024) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.2402.11437 · Cited by 3
S-Leak: Leakage-Abuse Attack Against Efficient Conjunctive SSE via s-term LeakagePreprint
Su, Y., Shen, M., Zuo, C., Liu, Y., & Zhu, L. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.04077 · Cited by 3
Stoer, M., & Wagner, F. (1994) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-22375 · Cited by 3
Vrba, Ž. (2009) · NORA - Norwegian Open Research Archives · Cited by 3
Pirkwieser, S. (2006) · reposiTUm (TU Wien) · Cited by 3
An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest PathsPreprint
Khanna, S., & Song, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.16638 · Cited by 3
Décompositions et Visualisations de graphes : applications aux données biologiques
Bourqui, R. (2008) · theses.fr (ABES) · doi:10.70675/b4785d49z863bz4e22zbeb5z630bf864ca4e · Cited by 3
Temporal centralities : a study of the importance of nodes in dynamic graphs
Ghanem, M. (2018) · theses.fr (ABES) · doi:10.70675/bcc0491fz4a21z4fa4z97b2ze6f69c0e6874 · Cited by 3
A mechanistic approach to plankton migration
Monthiller, R. (2022) · theses.fr (ABES) · doi:10.70675/b9095058z8af9z4252z8dd3za4fc13b532de · Cited by 3
Running stream-like programs on heterogeneous multi-core systems
Carpenter, P. (2011) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-94642 · Cited by 3
User behaviour modelling in a multi-dimensional environment for personalization and recommendation
Rawat, R. (2010) · Cited by 3
Variações e aplicações do algoritmo de Dijkstra
Takaki, P. (2007) · doi:10.47749/t/unicamp.2007.408727 · Cited by 3
Lasso formulation of the shortest path problem
Dong, A., Taghvaei, A., & Georgiou, T. T. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303909 · Cited by 2
Navarro, G., Paredes, R., Poblete, P. V., & Sanders, P. (2011) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054111008507 · Cited by 2
Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic
Collette, S., & Iacono, J. (2024) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977912.95 · Cited by 2
Cost-Distance Steiner Trees for Timing-Constrained Global Routing
Held, S., & Perner, E. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11132669 · Cited by 2
Oliva-González, I., & Jiménez‐Hernández, H. (2026) · Algorithms · doi:10.3390/a19050352 · Cited by 2
From Hop Reduction to Sparsification for Negative Length Shortest Paths
Quanrud, K., & Tajkhorshid, N. (2026) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3798129.3800902 · Cited by 2
Anonymous, Elahi, P. J., Varetto, U., He, K., Hou, J., & Liu, S. (2026) · Physical Review Applied · doi:10.1103/1hwv-bmqs · Cited by 2
Even, G. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139015165.004 · Cited by 2
INTERACTIVE NAVIGATION OF VIRTUAL VESSEL TRACKING WITH 3D INTELLIGENT SCISSORS
Heng, P., Sun, H., Chen, K.-W., & Wong, T. (2001) · International Journal of Image and Graphics · doi:10.1142/s0219467801000177 · Cited by 2
Problems in Data Structures and Algorithms
Tarjan, R. E. (2005) · Springer eBooks · doi:10.1007/0-387-25036-0_2 · Cited by 2
Self-citationAndreica, M. I. (2014) · Theory and Applications of Mathematics & Computer Science · doi:10.62591/tamcs.2014.1.01 · Cited by 2
Prior State Reasoning in Multi-agent Systems and Graph-Theoretical Algorithms
Li, C., & Liu, L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45343-4_21 · Cited by 2
Chapter 10 Network Routing Application
Salleh, S., & Abas, Z. A. (2016) · CRC Press eBooks · doi:10.1201/9781315370927-11 · Cited by 2
A Comparison of One-Pass and Bi-directional Approaches Applied to Large-Scale Road Inspection
Chen, Y., Polack, F., Cowling, P., & Remde, S. (2017) · Communications in computer and information science · doi:10.1007/978-3-319-53982-9_11 · Cited by 2
Image Segmentation via Weighted Carving Decompositions
Mikesell, D., & Hicks, I. V. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59108-7_21 · Cited by 2
Strategic Planning of Public Transport Services
Gkiotsalitis, K. (2022) · Springer eBooks · doi:10.1007/978-3-031-12444-0_8 · Cited by 2
kMiST: A KD-Tree Based Fast Minimum Spanning Tree Algorithm
Ghosh, P., & Mishra, G. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10724535 · Cited by 2
Solving Minimum Spanning Tree Problem in Spiking Neural Networks: Improved Results
Janssen, S., Groenen, S., Reichert, S., & Kwisthout, J. (2024) · International Conference on Neuromorphic Systems (ICONS) · doi:10.1109/icons62911.2024.00015 · Cited by 2
Computing Safest $st$-Paths in Backbone Networks: Efficiently Solvable Cases and Fast Heuristics
Vass, B., Revisnyei, P., & Pašíć, A. (2024) · International Workshop on Resilient Networks Design and Modeling (RNDM) · doi:10.1109/rndm64105.2024.10820391 · Cited by 2
Neuromorphic Computing for Graph Analytics
Das, A. K. (2024) · doi:10.1145/3676536.3698024 · Cited by 2
Finding a Shortest Curve that Separates Few Objects from Many
Biedl, T., de Verdière, É. C., Frati, F., Lubiw, A., & Rote, G. (2025) · Journal of computational geometry · doi:10.20382/jocg.v17i2a3 · Cited by 2
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
Obata, Y., & Nishizeki, T. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.07.052 · Cited by 2
Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions
Shioura, A., & Suzuki, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20877-5_15 · Cited by 2
Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
Czekaj, J., & Socha, L. (2009) · IFIP advances in information and communication technology · doi:10.1007/978-3-642-04802-9_11 · Cited by 2
Faster algorithm to find anti-risk path between two nodes of an undirected graph
Mahadeokar, J., & Saxena, S. (2012) · Journal of Combinatorial Optimization · doi:10.1007/s10878-012-9553-0 · Cited by 2
Gomes, T., Craveirinha, J., & Jorge, L. (2009) · Journal of Combinatorial Optimization · doi:10.1007/s10878-009-9255-4 · Cited by 2
Performance of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation
Sakumoto, Y., Ohsaki, H., & Imase, M. (2012) · IEICE Transactions on Communications · doi:10.1587/transcom.e95.b.1592 · Cited by 2
On a pair of job-machine assignment problems with two stages
Volgenant, A., & Duin, C. W. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2009.05.009 · Cited by 2
An Experimental Study for Optimal Homotopy Property of Motion Planning Algorithms
Yang, L., Zhang, J., Zeng, Y., Yao, H., Li, J., & Zhang, J. (2019) · IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech) · doi:10.1109/dasc/picom/cbdcom/cyberscitech.2019.00133 · Cited by 2
Engineering a Parallel Δ-stepping Algorithm
Duriakova, E., Ajwani, D., & Hurley, N. (2019) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata47090.2019.9006237 · Cited by 2
Maruf, M., & Karpatne, A. (2021) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976700.31 · Cited by 2
A Fast Approximate Skeleton with Guarantees for Any Cloud of Points in a Euclidean Space
Elkin, Y., Liu, D., & Kurlin, V. A. (2021) · Mathematics and visualization · doi:10.1007/978-3-030-83500-2_13 · Cited by 2
A Novel Approach to Find Minimum Cost Spanning Tree (MST) of a Graph
Srinivas, R., Reddy, T. R., Lalitha, R. V. S., & Vahida, S. (2021) · Lecture notes in networks and systems · doi:10.1007/978-981-16-0980-0_9 · Cited by 2
Ambrosino, D., Cerrone, C., & Sciomachen, A. F. (2022) · Algorithms · doi:10.3390/a15100364 · Cited by 2
List of Selected Number of Optimal Solutions of the Assignment Problem by Time Criterion
Laskov, L. M., & Marinov, M. L. (2022) · International Conference Automatics and Informatics (ICAI) · doi:10.1109/icai55857.2022.9959982 · Cited by 2
Multi-Level Elliptic Dijkstra's Algorithm for Finding Optimal Trajectory of Aircrafts
Do, V. H., & Hoàng, N.-D. (2023) · International Conference on Knowledge and Systems Engineering/Proceedings · doi:10.1109/kse59128.2023.10299413 · Cited by 2
Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-Warshall
Deurloo, M., Donkers, M., Maarse, M., Rin, B. G., & Schutte, K. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.fun.2024.11 · Cited by 2
Priority queues with decreasing keys
Brodal, G. S. (2024) · Theoretical Computer Science · doi:10.1016/j.tcs.2024.114563 · Cited by 2
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing
Li, A., Stuckey, P. J., Koenig, S., & Kumar, T. K. S. (2024) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v17i1.31541 · Cited by 2
Xu, T., Hua, M., Yang, X., Cui, Y., Wang, F., & Li, S. C. (2024) · Journal of Applied Mathematics and Computing · doi:10.1007/s12190-024-02201-5 · Cited by 2
Shortest path counting in complex networks based on powers of the adjacency matrix
Tan, D., Deng, Y., Xiao, Y., & Wu, J. J. (2024) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0226144 · Cited by 2
Link prediction in complex networks based on resource transition capacity and local paths
Pan, X., Xu, G., & Chen, D. (2025) · Modern Physics Letters B · doi:10.1142/s0217984925501222 · Cited by 2
Subiñas, S. M., Martin, J. M., Ali, A. M., Sedano, J., & García-Vico, Á. M. (2025) · doi:10.5220/0013489000004525 · Cited by 2
The random generation of Latin rectangles based on the assignment problem
Iftikhar, F., & Nagy, G. P. (2025) · Discrete Applied Mathematics · doi:10.1016/j.dam.2025.07.049 · Cited by 2
Algorithm Engineering of SSSP With Negative Edge Weights
Cassis, A., Karrenbauer, A., Nusser, A., & Rinaldi, P. L. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2025.10 · Cited by 2
Replacing Mark Bits with Randomness in Fibonacci Heaps
Li, J. Z., & Peebles, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47672-7_72 · Cited by 2
Cruz‐Barbosa, R., Bautista-Villavicencio, D., & Vellido, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25085-9_57 · Cited by 2
Faster separation of 1-wheel inequalities by graph products
de Vries, S. (2014) · Discrete Applied Mathematics · doi:10.1016/j.dam.2014.07.027 · Cited by 2
Guitart, P. (2001) · Electronic Notes in Discrete Mathematics · doi:10.1016/s1571-0653(04)00378-6 · Cited by 2
Spanning trees and shortest paths in monge graphs
Dudás, T., & Rudolf, R. (1998) · Computing · doi:10.1007/bf02684360 · Cited by 2
Graph-distance distribution of the Boltzmann ensemble of RNA secondary structures
Qin, J., Fricke, M., Marz, M., Stadler, P. F., & Backofen, R. (2014) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-9-19 · Cited by 2
Multipath creation algorithm optimizing traffic dispersion on networks
Matsuura, H. (2011) · Asia-Pacific Network Operations and Management Symposium (APNOMS) · doi:10.1109/apnoms.2011.6077016 · Cited by 2
Better Approximation Algorithms for Grasp-and-Delivery Robot Routing Problems
Shurbevski, A., Nagamochi, H., & Karuno, Y. (2013) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e96.d.450 · Cited by 2
Multi-Scale LPA* with low worst-case complexity guarantees
Lu, Y., Huo, X., Arslan, O., & Tsiotras, P. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6094705 · Cited by 2
Sharing information in all pairs shortest path algorithms
Takaoka, T., & Hashim, M. (2011) · Computing: The Australasian Theory Symposium · Cited by 2
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.