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 1,701–1,800 of 3,140
Zhang, W., Zhang, L., & Chen, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-05051-1_24 · Cited by 5
A new algorithm for the shortest‐path problem
Elmasry, A., & Shokry, A. (2018) · Networks · doi:10.1002/net.21870 · Cited by 5
GERoMe-a Method for Evaluating Stability of Graph Extraction Algorithms Without Ground Truth
Drees, D., Scherzinger, A., & Jiang, X. (2019) · IEEE Access · doi:10.1109/access.2019.2898754 · Cited by 5
Computing Long Sequences of Consecutive Fibonacci Integers with TensorFlow
Δρακόπουλος, Γ., Liapakis, X., Evaggelos Spyrou, A., Tzimas, G. E., Phivos Mylonas, B., & Sioutas, S. (2019) · IFIP advances in information and communication technology · doi:10.1007/978-3-030-19909-8_13 · Cited by 5
Shortest distances as enumeration problem
Casel, K., Friedrich, T., Neubert, S., & Schmid, M. L. (2023) · Discrete Applied Mathematics · doi:10.1016/j.dam.2023.08.027 · Cited by 5
Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors
Cho, H., & Easwaran, A. (2020) · IEEE Access · doi:10.1109/access.2020.3024692 · Cited by 5
Algorithmic Analysis of Priority-Based Bin Packing
Wojciechowski, P. J., Subramani, K., Velasquez, A., & Caskurlu, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-67899-9_29 · Cited by 5
An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems
Dadush, D., Koh, Z. K., Natura, B., & Végh, L. A. (2022) · Mathematics of Operations Research · doi:10.1287/moor.2022.1326 · Cited by 5
Salvatierra, M. M., Salvatierra, M. M., & Colonna, J. G. (2021) · Algorithms · doi:10.3390/a14100279 · Cited by 5
Optimization of regional transport networks based on a mathematical model of passenger preferences
Kostenko, V., Голубцов, В. А., Pank, R. V., & Shmidt, A. O. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2131/3/032101 · Cited by 5
Ito, H., Nagamochi, H., Sugiyama, Y., & Fujita, M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36136-7_39 · Cited by 5
Fat Heaps without Regular Counters
Elmasry, A., & Katajainen, J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28076-4_18 · Cited by 5
Exploring Power-Efficient Provisioning for Online Virtual Network Requests
Sun, G., Yu, H., Anand, V., Liao, D., & Li, L. (2012) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2012.34 · Cited by 5
The Online Replacement Path Problem
Adjiashvili, D., Oriolo, G., & Senatore, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40450-4_1 · Cited by 5
Karuno, Y., Nagamochi, H., & Shurbevski, A. (2012) · Journal of the Operations Research Society of Japan · doi:10.15807/jorsj.55.181 · Cited by 5
FINDING THE MOST VITAL EDGE FOR GRAPH MINIMIZATION PROBLEMS ON MESHES AND HYPERCUBES
Liang, W., Shen, X., & Hu, Q. (2000) · ANU Open Research (Australian National University) · Cited by 5
PittPatt Face Detection and Tracking for the CLEAR 2007 Evaluation.
Nechyba, M. C., Brandy, L., & Schneiderman, H. (2007) · CLEaR · Cited by 5
Algorithms: A Top-Down Approach
Howell, R. (2003) · Cited by 5
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
Sneyers, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02846-5_41 · Cited by 5
Tree Decompositions with Small Cost
Bodlaender, H. L., & Fomin, F. V. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45471-3_39 · Cited by 5
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
Gfeller, B. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8_38 · Cited by 5
Research on the Travel Route Based on Optimization Schedule
Fang, S. (2013) · International Conference on Intelligent System Design and Engineering Application (ISDEA) · doi:10.1109/isdea.2013.529 · Cited by 5
Recognizing Bellman–Ford-Orderable Graphs
Haddad, R. W., & Schäffer, A. A. (1988) · SIAM Journal on Discrete Mathematics · doi:10.1137/0401045 · Cited by 5
Fast geometric approximation techniques and geometric embedding problems
Bern, M. W., Karloff, H. J., Raghavan, P., & Schieber, B. (1989) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73833.73866 · Cited by 5
Yamada, I., & Okabe, A. (2000) · Theory and Applications of GIS · doi:10.5638/thagis.8.75 · Cited by 5
Experimental Evaluation of a New Shortest Path Algorithm (Extended Abstract)
Pettie, S., Ramachandran, V., & Sridhar, S. (2002) · Cited by 5
FB-APSP: A new efficient algorithm for computing all-pairs shortest-paths
Pereira, D., & Wille, E. C. G. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.07.014 · Cited by 5
Tradespace exploration for space system architectures : a weighted graph framework
Davison, P. (2014) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5
Efficient algorithms for shortest path and visibility problems
Hershberger, J. E. (1987) · Cited by 5
Performance analysis and portability of the PLUM load balancing system
Oliker, L., Biswas, R., & Gabow, H. N. (1998) · Lecture notes in computer science · doi:10.1007/bfb0057867 · Cited by 5
Finding the k shortest paths in parallel
Ruppert, E. (1997) · Lecture notes in computer science · doi:10.1007/bfb0023482 · Cited by 5
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Tazari, S., & Müller‐Hannemann, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92248-3_32 · Cited by 5
On Wireless Link Scheduling and Flow ControlPreprint
Gore, A. D. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4744 · Cited by 5
Viterbi Algorithm Generalized for n-Tape Best-Path SearchPreprint
Kempe, A. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0612041 · Cited by 5
Optimal clip ordering for multi-clip queries
Ng, R. T., & Shum, P. (1998) · The VLDB Journal · doi:10.1007/s007780050067 · Cited by 5
An analogue of Hoffman's circulation conditions for max-balanced flows
Hartmann, M. E., & Schneider, M. H. (1992) · Mathematical Programming · doi:10.1007/bf01581095 · Cited by 5
Efficient truthful mechanisms for the single‐source shortest paths tree problem
Gualà, L., & Proietti, G. (2007) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.1167 · Cited by 5
Improvements over two phase shortest path algorithm
Qureshi, M. A., & Hassan, M. F. (2010) · International Symposium on Information Technology · doi:10.1109/itsim.2010.5561538 · Cited by 5
Limit Theory for Performance Modeling of Future Event Set Algorithms
Damerdji, H., & Glynn, P. W. (1998) · Management Science · doi:10.1287/mnsc.44.12.1709 · Cited by 5
The design of a precompensator for multivariable adaptive control-a network-theoretic approach
Asano, T., Yoshikawa, K., & Suzuki, S. (1990) · IEEE Transactions on Automatic Control · doi:10.1109/9.53549 · Cited by 5
Re-scheduling in railways: the rolling stock balancing problemPreprint
Budai, G., Maróti, G., Dekker, R., Huisman, D., & Kroon, L. (2007) · RePEc: Research Papers in Economics · Cited by 5
Inverse Spanning Tree Problems: Formulations and Algorithms
Sokkalingam, P. T., Ahuja, R. K., & Orlin, J. B. (2011) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5
Abstract domains for reordering CLP(RLin) programs
Ramachandran, V., Hentenryck, P. V., & Cortesi, A. (2000) · The Journal of Logic Programming · doi:10.1016/s0743-1066(99)00011-4 · Cited by 5
Computing the n × m Shortest Paths Efficiently
Shibuya, T. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48518-x_13 · Cited by 5
Average-case complexity of shortest-paths problems
Priebe, V. (2001) · Max Planck Institute for Plasma Physics · doi:10.22028/d291-25863 · Cited by 5
Economics definitions, methods, models, and analysis procedures for Homeland Security applications.
Ehlen, M. A., Loose, V., Vargas, V., Smith, B. J., Warren, D., Downes, P. S., Eidson, E. D., & Mackey, G. E. (2010) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1097196 · Cited by 5
Optimal Purely Functional Priority Queues
Brodal, G. S., & Okasaki, C. (1996) · BRICS Report Series · doi:10.7146/brics.v3i37.20019 · Cited by 5
Fine-Grained Complexity and Conditional Hardness for Sparse GraphsPreprint
Agarwal, U., & Ramachandran, V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.07008 · Cited by 5
Cycling in Toronto: Route Choice Behavior and Implications to Infrastructure Planning
Li, S. (2017) · UWSpace (University of Waterloo) · Cited by 5
Spanning tree modulus: deflation and a hierarchical graph structure
Clemens, J. (2018) · K-State Research Exchange (Kansas State University) · Cited by 5
DRONE: a Distributed Subgraph-Centric Framework for Processing Large Scale Power-law GraphsPreprint
Wen, X., Zhang, S., & You, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.04380 · Cited by 5
Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weightsPreprint
Li, S., & Li, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.01756 · Cited by 5
Timing-Constrained Global Routing with Buffered Steiner Trees
Rotter, D. (2017) · bonndoc (University of Bonn) · Cited by 5
Multimodal Journey Planning and Assignment in Public Transportation Networks
Zündorf, T. (2022) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000145076 · Cited by 5
A separation heuristic for 2-partition inequalities for the clique partitioning problem
Sørensen, M. M. (2020) · Cited by 5
Approche cognitive pour la planification de trajectoire sous contraintes
Gaillard, F. (2012) · theses.fr (ABES) · doi:10.70675/fc573894z2c55z4750zbb6bz0fba4e819fca · Cited by 5
Fairness-oriented multicast routing for distributed interactive applications
Ferreira, I. F., Peixoto, M. L. M., & Figueiredo, G. B. (2024) · Computer Communications · doi:10.1016/j.comcom.2024.03.015 · Cited by 4
Yan, S. (2026) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978964.32 · Cited by 4
MAPF-HD: Multi-Agent Path Finding in High-Density Environments
Makino, H., & Ito, S. (2026) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2025.3642762 · Cited by 4
A Faster Directed Single-Source Shortest Path Algorithm
Duan, R., Mao, X., Shu, X., & Yin, L. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2026.81 · Cited by 4
From Think Parallel to Think Sequential
Fan, W., Cao, Y., Xu, J., Yu, W., Wu, Y., Tian, C., Jiang, J., & Zhang, B. (2018) · ACM SIGMOD Record · doi:10.1145/3277006.3277011 · Cited by 4
A practical multi-objective auction design and optimization framework for sponsored search
Li, Q., Wang, L., Xia, L., Zheng, W., & Zhou, Y. (2023) · Operations Research Letters · doi:10.1016/j.orl.2023.09.001 · Cited by 4
Chang, Y., & Wang, X. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3596073 · Cited by 4
msf-CNN: Patch-based Multi-Stage Fusion with Convolutional Neural Networks for TinyML
Huang, Z., & Baccelli, E. (2025) · neural information processing systems · doi:10.52202/085713-2415 · Cited by 4
The mathematics of generalized Fibonacci sequences: Binet's formula and identities
Verma, K. L. (2025) · Mathematica Moravica · doi:10.5937/matmor2501113v · Cited by 4
Graph-Based Dimensionality Reduction
Lee, J. A., & Verleysen, M. (2017) · CRC Press eBooks · doi:10.1201/b12281-12 · Cited by 4
The stochastic quickest path problem via minimal paths
Lin, Y. (2010) · Journal of the Chinese Institute of Industrial Engineers · doi:10.1080/10170660903533812 · Cited by 4
An Encoding Algorithm Based on the Shortest Path Problem
Liu, F., Tang, X., & Yang, Z. (2018) · International Conference on Computational Intelligence and Security (CIS) · doi:10.1109/cis2018.2018.00016 · Cited by 4
Jungnickel, D. (2012) · Algorithms and computation in mathematics · doi:10.1007/978-3-642-32278-5_4 · Cited by 4
Influence Minimization With Conformity-Aware Competitions
Gong, Y., Liu, S., & Bai, Y. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2022.3204751 · Cited by 4
Priority-based bin packing with subset constraints
Wojciechowski, P. J., Subramani, K., Velasquez, A., & Caskurlu, B. (2023) · Discrete Applied Mathematics · doi:10.1016/j.dam.2023.08.019 · Cited by 4
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
Saha, B., Williams, V. V., Xu, Y., & Ye, C. (2025) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978322.175 · Cited by 4
Augmenting Graphs to Minimize the Diameter
Frati, F., Gaspers, S., Gudmundsson, J., & Mathieson, L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45030-3_36 · Cited by 4
On A☆search with stopover areas
Sander, T., & Wehner, P. (2009) · International Journal of Geographical Information Systems · doi:10.1080/13658810902885375 · Cited by 4
Computing the nxm shortest path efficiently
Shibuya, T. (2000) · ACM Journal of Experimental Algorithmics · doi:10.1145/351827.384251 · Cited by 4
Change Awareness in Opportunistic Networks
Guo, X. F., & Chan, M. C. (2013) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass.2013.50 · Cited by 4
Solving shortest path problems with curvature constraints using beamlets
Arslan, O., Tsiotras, P., & Huo, X. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6094862 · Cited by 4
Approximate Shortest Homotopic Paths in Weighted Regions
Cheng, S.-W., Jin, J., Vigneron, A., & Wang, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17514-5_10 · Cited by 4
Energy-Efficient Joint Scheduling and Application-Specific Interconnection Design
Xu, C. Q., Xue, C. J., & Sha, E. H. ‐. (2010) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2010.2062544 · Cited by 4
Reliability evaluation of a multistate network subject to time constraint under routing policy
Lin, Y. (2012) · International Journal of Systems Science · doi:10.1080/00207721.2012.659684 · Cited by 4
Temporal Flexibility Revisited: Maximizing Flexibility by Computing Bipartite Matchings
Mountakis, K. S., Klos, T., & Witteveen, C. (2015) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v25i1.13720 · Cited by 4
Efficient algorithms for the all pairs shortest path problem with limited edge costs
Takaoka, T. (2012) · Computing: The Australasian Theory Symposium · Cited by 4
Fibonacci helps to evacuate from a convex region in a grid network
Qin, L., & Xu, Y. (2016) · Journal of Combinatorial Optimization · doi:10.1007/s10878-016-9998-7 · Cited by 4
Das, S. (2020) · Scientific Annals of Computer Science · doi:10.7561/sacs.2020.1.39 · Cited by 4
Discrete convexity in joint winner property
Iwamasa, Y., Murota, K., & Živný, S. (2018) · Discrete Optimization · doi:10.1016/j.disopt.2018.01.001 · Cited by 4
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Chalopin, J., Das, S., Disser, Y., Labourel, A., & Mihaľák, M. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.04.004 · Cited by 4
A fully polynomial time approximation scheme for the probability maximizing shortest path problem
Lee, J., Joung, S., & Lee, K. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.10.018 · Cited by 4
Energy efficiency mechanism using mobile-based Fermat's spiral in WSN
Mantoro, T., Ali, H. S., & Ayu, M. A. (2011) · Cited by 4
Energy efficient joint scheduling and multi-core interconnect design
Xu, C. Q., Xue, C. J., He, Y. Q., & Sha, E. H. ‐. (2010) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2010.5419678 · Cited by 4
Improved Approximation Algorithms for Bin Packing with Conflicts
Huang, Z., Zhang, A., Dósa, G., Chen, Y., & Xiong, C. (2023) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054122460054 · Cited by 4
Collaborative non-chain DNN inference with multi-device based on layer parallel
Zhang, Q., Sun, S., Luo, J., Liu, M., Li, Z., Yang, H., & Wang, Y. (2023) · Digital Communications and Networks · doi:10.1016/j.dcan.2023.11.004 · Cited by 4
Ingress: an automated incremental graph processing system
Gong, S., Tian, C., Yin, Q., Wang, Z., Yu, S., Zhang, Y., Yu, W., Geng, L., Fu, C., Yu, G., et al. (2024) · The VLDB Journal · doi:10.1007/s00778-024-00838-z · Cited by 4
K-shortest simple paths using biobjective path search
Casas, P. M. D. L., Sedeño‐Noda, A., Borndörfer, R., & Huneshagen, M. (2025) · Mathematical Programming Computation · doi:10.1007/s12532-025-00276-0 · Cited by 4
Wu, B. Y. (2012) · Journal of Combinatorial Optimization · doi:10.1007/s10878-012-9481-z · Cited by 4
Autonomic goal-oriented device management for Smart Environments
Sanaullah, M., Corno, F., & Razzak, F. (2015) · Journal of Ambient Intelligence and Smart Environments · doi:10.3233/ais-150329 · Cited by 4
The K-D heap: An efficient multi-dimensional priority queue
Ding, Y., & Weiss, M. A. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57155-8_257 · Cited by 4
Shipping problems with body clock constraints
Chen, Y., & Hsiao, L.-J. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00054-0 · Cited by 4
A Novel Shortest Path Method Based on Heuristic Algorithm
Yangeng, W., Zang, W., & Li, C. (2010) · Machine Vision and Human-machine Interface · doi:10.1109/mvhi.2010.157 · Cited by 4
Indexed Bloom Filters for Web Caches Summaries
Lefebvre, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40495-5_51 · Cited by 4
Shortest path ray tracing in cell model with a second-level forward star: SPM w/2nd-level cells
Mak, S., & Koketsu, K. (2011) · Geophysical Journal International · doi:10.1111/j.1365-246x.2011.05103.x · Cited by 4
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.