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,401–1,500 of 3,140
Geometric Data SciencePreprint
Anosova, O. D., & Kurlin, V. A. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.05040 · Cited by 9
Length-constrained cycle partition with an application to UAV routing*
Hoppmann‐Baum, K., Burdakov, O. P., Mexi, G., Casselgren, C. J., & Koch, T. (2022) · Optimization methods & software · doi:10.1080/10556788.2022.2053972 · Cited by 8
Faster Submodular Maximization for Several Classes of Matroids
Henzinger, M. R., Liu, P., Vondrák, J., & Zheng, D. W. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2023.74 · Cited by 8
Strategic Resource Selection with Homophilic Agents
Harder, J. G., Krogmann, S., Lenzner, P., & Skopalik, A. (2023) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2023/301 · Cited by 8
Fast and Simple Sorting Using Partial Information
Haeupler, B., Hladík, R., Iacono, J., Rozhoň, V., Tarjan, R. E., & Tětek, J. (2026) · Algorithmica · doi:10.1007/s00453-026-01387-3 · Cited by 8
Self-citationEfficient Session-based Recommendation with Contrastive Graph-based Shortest Path Search
Peintner, A., Mohammadi, A. R., & Zangerle, E. (2024) · ACM Transactions on Recommender Systems · doi:10.1145/3701764 · Cited by 8
Efficiency of Self-Adjusting Heaps
Sinnamon, C., & Tarjan, R. E. (2024) · ACM Transactions on Algorithms · doi:10.1145/3708989 · Cited by 8
Self-citationSimpler Universally Optimal Dijkstra
van der Hoog, I., Rotenberg, E., & Rutschmann, D. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2025.71 · Cited by 8
Søvde, N. E., Sætersdal, M., & Løkketangen, A. (2014) · Forests · doi:10.3390/f5092327 · Cited by 8
Optimizing Scheduling and Intercluster Connection for Application-Specific DSP Processors
Xu, C. Q., Xue, C. J., Hu, J., & Sha, E. H. ‐. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2024870 · Cited by 8
Shortest Path Computation in a Network with Multiple Destinations
Sepehrifar, M. K., Fanian, A., & Sepehrifar, M. B. (2020) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-020-04340-w · Cited by 8
Secret Key Generation Based on Manipulated Channel Measurement Matching
Du, Y., Dai, H., Liu, H., Wang, Y., Li, G., Ren, Y., Chen, Y. J., & Zhang, K. (2024) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2024.3364909 · Cited by 8
Fast Planning for Dynamic Preferences
Ziebart, B. D., Dey, A. K., & Bagnell, J. A. (2018) · KiltHub Repository · doi:10.1184/r1/6554879 · Cited by 8
PASS: A Parallel Activity-Search System
Pugliese, A., Subrahmanian, V. S., Thomas, C., & Molinaro, C. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.171 · Cited by 8
Rendezvous point based approach to the multi-constrained multicast routing problem
Stachowiak, K., & Zwierzykowski, P. (2014) · AEU - International Journal of Electronics and Communications · doi:10.1016/j.aeue.2014.01.002 · Cited by 8
A Rectangle-Intersection Algorithm with Limited Resource Requirements
Dévai, F., & Neumann, L. (2010) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2010.402 · Cited by 8
Routing algorithm of minimizing maximum link congestion on grid networks
Xu, J., Yang, J., Guo, C., Lee, Y.-H., & Lu, D. (2014) · Wireless Networks · doi:10.1007/s11276-014-0878-8 · Cited by 8
Hierarchically Nested Convex VCSP
Cooper, M., & Živný, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23786-7_16 · Cited by 8
A Dijkstra-Type Algorithm for Dynamic Games
Bardi, M., & López, J. P. M. (2015) · Dynamic Games and Applications · doi:10.1007/s13235-015-0156-0 · Cited by 8
Arbib, C., Karaşan, O. E., & Pınar, M. Ç. (2018) · Discrete Applied Mathematics · doi:10.1016/j.dam.2018.03.034 · Cited by 8
Closest Paths in Graph Drawings under an Elastic Metric
Baran, M. (2018) · International Journal of Applied Mathematics and Computer Science · doi:10.2478/amcs-2018-0029 · Cited by 8
A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs
Wu, B. Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24983-9_19 · Cited by 8
On Some New Arithmetic Properties of the Generalized Lucas Sequences
Andrica, D., & Bagdasar, O. D. (2021) · Mediterranean Journal of Mathematics · doi:10.1007/s00009-020-01653-w · Cited by 8
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem
Khazraei, A., & Held, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-80879-2_13 · Cited by 8
Analysis of Smooth Heaps and Slim Heaps
Hartmann, M., Kozma, L., Sinnamon, C., & Tarjan, R. E. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2021.79 · Cited by 8
Self-citationGong, J., & Nazari, H. (2021) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-021-03560-8 · Cited by 8
Spanning Trees and Arborescences
Körte, B., & Vygen, J. (2018) · Algorithms and combinatorics · doi:10.1007/978-3-662-56039-6_6 · Cited by 8
Efficient Trip Planning for Maximizing User Satisfaction
Zhu, C., Xu, J., Chengfei Liu, A., Zhao, P., Liu, A., & Zhao, L. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18120-2_16 · Cited by 8
Unicast QoS Routing in Overlay Networks
Ilie, D., & Popescu, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-02742-0_43 · Cited by 8
Via Detours to I/O-Efficient Shortest Paths
Meyer, U. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03456-5_15 · Cited by 8
A Game-Theoretic Approach to Stable Routing in Max-Min Fair Networks
Yang, D., Xue, G., Fang, X., Misra, S., & Zhang, J. (2013) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2247416 · Cited by 8
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation
Lee, J., Leung, J. M. Y., & de Vries, S. (2005) · Journal of Combinatorial Optimization · doi:10.1007/s10878-005-5484-3 · Cited by 8
Graph Node Clustering via Transitive Node Similarity
Tiakas, E., Papadopoulos, A. N., & Manolopoulos, Y. (2010) · Panhellenic Conference on Informatics · doi:10.1109/pci.2010.42 · Cited by 8
Efficient implementation of the generalized Tunstall code generation algorithm
Baer, M. B. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205733 · Cited by 8
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
Bilò, D., Gualà, L., & Proietti, G. (2014) · Algorithmica · doi:10.1007/s00453-014-9912-6 · Cited by 8
Lin, C.-H., Dong, F., & Hirota, K. (2014) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2014.p0009 · Cited by 8
Nonlinear multi-output regression on unknown input manifold
Kuleshov, A., & Bernstein, A. (2017) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-017-9551-0 · Cited by 8
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
Wu, B. Y. (2011) · Algorithmica · doi:10.1007/s00453-011-9601-7 · Cited by 8
Restricted orientation computational geometry
Nilsson, B. J., Ottmann, T., Schuierer, S., & Icking, C. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55488-2_26 · Cited by 8
A Novel Approach for Finding a Shortest Path in a Mixed Fuzzy Network
Tajdin, A., Mahdavi, I., Mahdavi‐Amiri, N., Gildeh, B. S., & Hassanzadeh, R. (2010) · Wireless Sensor Network · doi:10.4236/wsn.2010.22020 · Cited by 8
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
Eirinakis, P., Williamson, M. D., & Subramani, K. (2017) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00410 · Cited by 8
Geometric Optimization Revisited
Agarwal, P. K., Ezra, E. E., & Fox, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-319-91908-9_5 · Cited by 8
Pedro, V., Nyberg, E., & Carbonell, J. (2006) · KiltHub Repository · doi:10.1184/r1/6622250 · Cited by 8
How to treat delete requests in semi-online problems
Dai, Y., Imai, H., Iwano, K., & Katoh, N. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57568-5_234 · Cited by 8
Linear-time algorithms for geometric graphs with sublinearly many crossings
Eppstein, D., Goodrich, M. T., & Strash, D. (2009) · Symposium on Discrete Algorithms · doi:10.5555/1496770.1496788 · Cited by 8
An Optimum Vehicular Path Solution with Multi-heuristics
Lu, F., & Guan, Y. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25944-2_124 · Cited by 8
The non-approximability of bicriteria network design problems
Bálint, V. (2003) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00033-9 · Cited by 8
On dual minimum cost flow algorithms (extended abstract)
Vygen, J. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335319 · Cited by 8
Optimizing Address Assignment and Scheduling for DSPs With Multiple Functional Units
Xue, C. J., Shao, Z., Zhuge, Q., Xiao, B., Liu, M., & Sha, E. H. ‐. (2006) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/tcsii.2006.880026 · Cited by 8
How to find a minimum spanning tree in practice
Moret, B. M. E., & Shapiro, H. D. (2006) · Springer eBooks · doi:10.1007/bfb0038190 · Cited by 8
Finding the Optimal Shortest Path Tree with Respect to Single Link Failure Recovery
Li, Y., Nie, Z., & Zhou, X. (2008) · Networked Computing and Advanced Information Management · doi:10.1109/ncm.2008.56 · Cited by 8
Aggregators and Contextual Effects in Search Ad Markets
Gunawardana, A., & Meek, C. (2008) · Cited by 8
Efficient memory-limited graph search
Eckerle, J., & Schuierer, S. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60343-3_29 · Cited by 8
Maintaining a Minimum Spanning Tree under Transient Node Failures
Nardelli, E., Proietti, G., & Widmayer, P. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45253-2_32 · Cited by 8
On geometric path query problems
Chen, D. Z., Daescu, O., & Klenk, K. S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63307-3_64 · Cited by 8
Finding minimum spanning trees more efficiently for tile-based phase unwrapping
Sawaf, F., & Tatam, R. P. (2006) · Measurement Science and Technology · doi:10.1088/0957-0233/17/6/022 · Cited by 8
Controlled transitions between cupolets of chaotic systems
Morena, M. A., Short, K. M., & Cooke, E. E. (2014) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4862668 · Cited by 8
Tang, J., Wang, T., Wang, J., & Wei, D. (2009) · Social Network Mining and Analysis · doi:10.1145/1731011.1731018 · Cited by 8
Khuller, S. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90082-3 · Cited by 8
Finding real-valued single-source shortest paths in o(n 3) expected time
Kolliopoulos, S. G., & Stein, C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61310-2_8 · Cited by 8
Combining the Shortest Paths and the Bottleneck Paths ProblemsPreprint
Shinn, T.-W., & Takaoka, T. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.5081 · Cited by 8
Functional programming and graph algorithms
King, D. J. (1996) · Enlighten: Theses (The University of Glasgow) · Cited by 8
A Tight Lower Bound for Decrease-Key in the Pure Heap ModelPreprint
Iacono, J., & Özkan, Ö. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.6665 · Cited by 8
Parallel algorithms for permutation graphs
Yu, C. W., & Chen, G.-H. (1993) · BIT Numerical Mathematics · doi:10.1007/bf01990525 · Cited by 8
An efficient algorithm for commercial aircraft trajectory optimization in the air traffic system.
Devulapalli, R. (2012) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 8
Graph Construction for Manifold Discovery
Carey, C. (2017) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · doi:10.7275/10605896.0 · Cited by 8
Large sample spectral analysis of graph-based multi-manifold clusteringPreprint
Trillos, N. G., He, P., & Cheng-hui, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.13610 · Cited by 8
Kriege, N. M. (2015) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-16358 · Cited by 8
Sauvanet, G. (2011) · theses.fr (ABES) · doi:10.70675/6b530360z2716z433cza0efz9e6e2cb6ff76 · Cited by 8
Optimal motion planning in redundant robotic systems for automated composite lay-up process
Gao, J. (2018) · theses.fr (ABES) · doi:10.70675/1bb08e3ez1284z46a3z9861z1a20227b1fc2 · Cited by 8
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs
Duan, R., Lyu, K., Wu, H., & Xie, Y. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2018.43 · Cited by 7
BAR: Blockwise Adaptive Recoding for Batched Network Coding
Yin, H. H. F., Yang, S., Zhou, Q., Yung, L. M. L., & Ng, K. H. (2023) · Entropy · doi:10.3390/e25071054 · Cited by 7
Jacobi’s Bound: Jacobi’s results translated in Kőnig’s, Egerváry’s and Ritt’s mathematical languages
Ollivier, F. (2022) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-022-00547-6 · Cited by 7
Boundary Labeling in a Circular Orbit
Bonerath, A., Nöllenburg, M., Terziadis, S., Wallinger, M., & Wulms, J. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.gd.2024.22 · Cited by 7
van Staden, H. E., Yee, H., & Boute, R. N. (2024) · IMA Journal of Management Mathematics · doi:10.1093/imaman/dpae010 · Cited by 7
Matsuura, H., Koshiji, K., Yokoi, H., Matsukawa, T., & Fujii, T. (2024) · Journal of Optical Communications and Networking · doi:10.1364/jocn.525178 · Cited by 7
Brodal, G. S., Lagogiannis, G., & Tarjan, R. E. (2024) · ACM Transactions on Algorithms · doi:10.1145/3707692 · Cited by 7
Self-citationA Sublinear Algorithm for Approximate Shortest Paths in Large Networks
Basu, S., Kōshima, N., Eden, T., Ben‐Eliezer, O., & Seshadhri, C. (2025) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3701551.3703512 · Cited by 7
A Bayesian Framework for Clustered Federated Learning
Wu, P., Imbiriba, T., & Closas, P. (2025) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2025.3637562 · Cited by 7
Takada, Y., & Yamasaki, H. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01312-0 · Cited by 7
Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching
Дас, Ш., & Kapoor, K. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06089-7_22 · Cited by 7
Sharing information for the all pairs shortest path problem
Takaoka, T. (2013) · Theoretical Computer Science · doi:10.1016/j.tcs.2013.09.006 · Cited by 7
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
Agarwal, P. K., Fox, K., & Salzman, O. (2015) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974331.ch82 · Cited by 7
A Tight Analysis of Slim Heaps and Smooth Heaps
Sinnamon, C., & Tarjan, R. E. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977554.ch24 · Cited by 7
Self-citationA stochastic geometrical 3D model for time evolution simulation of microstructures in SOC-electrodes
Théodon, L., Laurencin, J., Hubert, M., Cloetens, P., & Debayle, J. (2022) · Computational Materials Science · doi:10.1016/j.commatsci.2022.111568 · Cited by 7
Rajabi-Alni, F., & Bagheri, A. (2023) · Journal of Mathematics · doi:10.1155/2023/7761902 · Cited by 7
A fuel-efficient reliable path finding algorithm in stochastic networks under spatial correlation
Teng, W., Zhang, Y., Chen, X.-Y., Duan, X., Wan, Q., & Yu, Y. (2023) · Fuel · doi:10.1016/j.fuel.2023.128733 · Cited by 7
Shortest Beer Path Queries Based on Graph Decomposition
Hanaka, T., Ono, H., Sadakane, K., & Sugiyama, K. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.isaac.2023.37 · Cited by 7
Nearest-Better Network for Fitness Landscape Analysis of Continuous Optimization Problems
Diao, Y., Li, C., Zeng, S., Yang, S., & Coello, C. A. C. (2024) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2024.3478825 · Cited by 7
On performance evaluation for a multistate network under spare routing
Lin, Y. (2012) · Information Sciences · doi:10.1016/j.ins.2012.03.016 · Cited by 7
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms
Tamir, O., Morrison, A., & Rinetzky, N. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.opodis.2015.15 · Cited by 7
Algorithm to prioritize the restoration of a multiple facility, multiple-hazard road network
Basavaraj, V. V., Shekar, V., Fiondella, L., Rahman, A., & Lownes, N. (2017) · Proceedings of the Institution of Mechanical Engineers Part O Journal of Risk and Reliability · doi:10.1177/1748006x17693484 · Cited by 7
An Efficient Approximate Algorithm for the 1-Median Problem on a Graph
Tabata, K., Nakamura, A., & Kudo, M. (2017) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2016edp7398 · Cited by 7
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs
Chowdhury, R., & Ramachandran, V. (2018) · ACM Transactions on Algorithms · doi:10.1145/3147172 · Cited by 7
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs
Duan, R., Gu, Y., & Zhang, L. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2018.44 · Cited by 7
Flow Network-Based Real-Time Scheduling for Reducing Static Energy Consumption on Multiprocessors
Sun, J., Cho, H., Easwaran, A., Park, J.-D., & Choi, B.-C. (2018) · IEEE Access · doi:10.1109/access.2018.2886562 · Cited by 7
Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices
Fu, Z.-H., Chen, S., Ming, Y.-F., Chen, Y.-Q., & Lai, X.-J. (2019) · IEEE Access · doi:10.1109/access.2019.2894829 · Cited by 7
Colini-Baldeschi, R., Mestre, J., Schrijvers, O., & Wilkens, C. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64946-3_4 · Cited by 7
Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort
Buchhold, V., Sanders, P., & Wagner, D. (2019) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/3347146.3359361 · Cited by 7
An offline map matching algorithm based on shortest paths
Zhang, D., Guo, Z., Guo, F., & Dong, Y. (2021) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2021.1919307 · Cited by 7
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.