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 201–300 of 3,140
Studying (non-planar) road networks through an algorithmic lens
Eppstein, D., & Goodrich, M. T. (2008) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/1463434.1463455 · Cited by 116
Mobile robot navigation in 2-D dynamic environments using an electrostatic potential field
Valavanis, K. P., Hebert, T., Kolluru, R., & Tsourveloudis, N. C. (2000) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/3468.833100 · Cited by 114
Experimental analysis of dynamic all pairs shortest path algorithms
Demetrescu, C., & Italiano, G. F. (2006) · ACM Transactions on Algorithms · doi:10.1145/1198513.1198519 · Cited by 113
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles
Thorup, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27810-8_33 · Cited by 113
Zhang, Z., Wei, L., & Lim, A. E. B. (2015) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2015.10.001 · Cited by 113
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
Frederickson, G. N. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1991.185429 · Cited by 112
Temporal Network Optimization Subject to Connectivity Constraints
Mertzios, G. B., Michail, O., & Spirakis, P. G. (2018) · Algorithmica · doi:10.1007/s00453-018-0478-6 · Cited by 110
Software verification and graph similarity for automated evaluation of students’ assignments
Janičić, M. V., Nikolić, M., Tošić, D., & Kunčak, V. (2012) · Information and Software Technology · doi:10.1016/j.infsof.2012.12.005 · Cited by 110
Finding the most vital node of a shortest path
Nardelli, E., Proietti, G., & Widmayer, P. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00438-3 · Cited by 110
Speed-Up Techniques for Shortest-Path Computations
Wagner, D., & Willhalm, T. (2007) · Springer eBooks · doi:10.1007/978-3-540-70918-3_3 · Cited by 110
An output sensitive algorithm for computing visibility graphs
Ghosh, S., & Mount, D. M. (1987) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1987.6 · Cited by 110
Zachariadis, E. E., & Kiranoudis, C. T. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.02.009 · Cited by 109
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
Atallah, M. J., & Kosaraju, S. R. (1988) · SIAM Journal on Computing · doi:10.1137/0217053 · Cited by 109
Improved Shortest Paths on the Word RAM
Hagerup, T. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45022-x_7 · Cited by 108
Acceleration of Shortest Path and Constrained Shortest Path Computation
Köhler, E., Möhring, R. H., & Schilling, H. (2005) · Lecture notes in computer science · doi:10.1007/11427186_13 · Cited by 108
Klein, P. N., Mozes, S., & Weimann, O. (2010) · ACM Transactions on Algorithms · doi:10.1145/1721837.1721846 · Cited by 108
Shortest paths in the plane with polygonal obstacles
Storer, J. A., & Reif, J. H. (1994) · Journal of the ACM · doi:10.1145/185675.185795 · Cited by 108
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Gen-Huey, C., & Yung-Chen, H. (1994) · Computers & Operations Research · doi:10.1016/0305-0548(94)90045-0 · Cited by 107
A scalable architecture for ordered parallelism
Jeffrey, M. C., Subramanian, S., Yan, C., Emer, J., & Sánchez, D. (2015) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/2830772.2830777 · Cited by 107
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568 · Cited by 107
Priority queues: Small, monotone and trans-dichotomous
Raman, R. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61680-2_51 · Cited by 107
Context‐based Space Filling Curves
Dafner, R., Cohen‐Or, D., & Matias, Y. (2000) · Computer Graphics Forum · doi:10.1111/1467-8659.00413 · Cited by 106
An efficient implementation of an algorithm for finding K shortest simple paths
Hadjiconstantinou, E., & Christofides, N. (1999) · Networks · doi:10.1002/(sici)1097-0037(199909)34:2<88::aid-net2>3.0.co;2-1 · Cited by 106
Improved Upper Bounds for Pairing Heaps
Iacono, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44985-x_5 · Cited by 105
Thorup, M. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780566 · Cited by 105
Geometric containers for efficient shortest-path computation
Wagner, D., Willhalm, T., & Zaroliagis, C. (2005) · ACM Journal of Experimental Algorithmics · doi:10.1145/1064546.1103378 · Cited by 105
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
Aleksandrov, L., Lanthier, M. A., Maheshwari, A., & Sack, J.-R. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054351 · Cited by 105
Dynamic shortest paths minimizing travel times and costs
Ahuja, R. K., Orlin, J. B., Pallottino, S., & Scutellà, M. G. (2003) · Networks · doi:10.1002/net.10072 · Cited by 104
Algorithms: Design Techniques and Analysis
Alsuwaiyel, M. H. (2021) · doi:10.1142/4002#t=toc · Cited by 104
Recent results on the single-source shortest paths problem
Raman, R. (1997) · ACM SIGACT News · doi:10.1145/261342.261352 · Cited by 103
The k-centrum multi-facility location problem
Tamir, A. (2001) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(00)00253-5 · Cited by 102
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
Chaudhuri, S., & Zaroliagis, C. (2000) · Algorithmica · doi:10.1007/s004530010016 · Cited by 102
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Peyer, S., Rautenbach, D., & Vygen, J. (2009) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2007.08.003 · Cited by 102
Fully dynamic all pairs shortest paths with real edge weights
Demetrescu, C., & Italiano, G. F. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.05.005 · Cited by 102
The shortest path problem with forbidden paths
Villeneuve, D. L., & Desaulniers, G. (2004) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.01.032 · Cited by 100
A Back-to-Basics Empirical Study of Priority Queues
Larkin, D. H., Sen, S., & Tarjan, R. E. (2013) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973198.7 · Cited by 99
Self-citationTrip-based graph partitioning in dynamic ridesharing
Tafreshian, A., & Masoud, N. (2020) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2020.02.008 · Cited by 99
GraphScope: a unified engine for big graph processing
Fan, W., He, T., Lai, L., Li, X., Li, Y., Li, Z., Qian, Z., Tian, C., Wang, L., Xu, J., et al. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3476311.3476369 · Cited by 98
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
Ausiello, G., Franciosa, P. G., & Frigioni, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45446-2_20 · Cited by 98
Finding the k quickest simple paths in a network
Chen, Y. (1994) · Information Processing Letters · doi:10.1016/0020-0190(94)00008-5 · Cited by 98
The all-pairs quickest path problem
Lee, D. T., & Papadopoulou, E. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90214-t · Cited by 98
All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms
Zwick, U. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743464 · Cited by 98
A New Differential Evolution Algorithm for Minimax Optimization in Robust Design
Qiu, X., Xu, J., Xu, Y., & Tan, K. C. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2692963 · Cited by 97
Cohen, E., & Zwick, U. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1117 · Cited by 97
Fast approximation of centrality
Eppstein, D., & Wang, J. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365449 · Cited by 97
LTRT: An efficient and reliable topology control algorithm for ad-hoc networks
Miyao, K., Nakayama, H., Ansari, N., & Kato, N. (2009) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2009.12.090073 · Cited by 97
Borgwardt, K. M. (2007) · doi:10.5282/edoc.7169 · Cited by 97
Communication-Aware UAV Path Planning
Mardani, A., Chiaberge, M., & Giaccone, P. (2019) · IEEE Access · doi:10.1109/access.2019.2911018 · Cited by 95
Ozaki, K., Shimbo, M., Komachi, M., & Matsumoto, Y. (2011) · Conference on Computational Natural Language Learning · Cited by 95
Stoer, M., & Wagner, F. (1994) · Lecture notes in computer science · doi:10.1007/bfb0049404 · Cited by 95
Wei, L., Zhang, Z., & Lim, A. E. B. (2014) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2014.2350933 · Cited by 94
A k shortest path algorithm for adaptive routing in communications networks
Topkis, D. M. (1988) · IEEE Transactions on Communications · doi:10.1109/26.2815 · Cited by 94
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps
Haeupler, B., Hladík, R., Rozhoň, V., Tarjan, R. E., & Tětek, J. (2024) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs61266.2024.00125 · Cited by 93
Self-citationEfficient and flexible algorithms for monitoring distance-based outliers over data streams
Kontaki, M., Gounaris, A., Papadopoulos, A. N., Tsichlas, K., & Manolopoulos, Y. (2015) · Information Systems · doi:10.1016/j.is.2015.07.006 · Cited by 93
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
Zachariadis, E. E., & Kiranoudis, C. T. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2009.06.021 · Cited by 93
Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
Cousty, J., & Najman, L. A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21569-8_24 · Cited by 93
Goldberg, A. V., Kaplan, H. Y., & Werneck, R. F. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72845-0_4 · Cited by 93
A Simple Shortest Path Algorithm with Linear Average Time
Goldberg, A. V. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44676-1_19 · Cited by 93
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems
Borassi, M., Crescenzi, P., & Habib, M. (2016) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2016.03.005 · Cited by 92
Fractional Combinatorial Optimization
Radzik, T. (1998) · Springer eBooks · doi:10.1007/978-1-4613-0303-9_6 · Cited by 92
A survey of geodesic paths on 3D surfaces
Bose, P. K., Maheshwari, A., Shu, C., & Wuhrer, S. (2011) · Computational Geometry · doi:10.1016/j.comgeo.2011.05.006 · Cited by 92
Buckets, Heaps, Lists, and Monotone Priority Queues
Cherkassky, B. V., Goldberg, A. V., & Silverstein, C. D. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539796313490 · Cited by 92
Parallel approximate undirected shortest paths via low hop emulators
Andoni, A., Stein, C., & Zhong, P. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384321 · Cited by 91
Zachariadis, E. E., & Kiranoudis, C. T. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.08.061 · Cited by 91
The electric vehicle touring problem
Liao, C.-S., Lu, S.-H., & Shen, Z. M. (2016) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2016.02.002 · Cited by 91
Parallelizing Sequential Graph Computations
Fan, W., Xu, J., Wu, Y., Yu, W., Jiang, J., Zheng, Z., Zhang, B., Cao, Y., & Tian, C. (2017) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3035918.3035942 · Cited by 91
Finding the K shortest paths in a schedule-based transit network
Xu, W. A., He, S., Song, R., & Chaudhry, S. S. (2010) · Computers & Operations Research · doi:10.1016/j.cor.2010.02.005 · Cited by 90
Approximation algorithms for geometric shortest path problems
Aleksandrov, L., Maheshwari, A., & Sack, J.-R. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335339 · Cited by 90
A Parallel Priority Queue with Constant Time Operations
Brodal, G. S., Träff, J. L., & Zaroliagis, C. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1998.1425 · Cited by 89
An Improved Multiobjective Shortest Path Algorithm
Casas, P. M. D. L., Sedeño‐Noda, A., & Borndörfer, R. (2021) · Computers & Operations Research · doi:10.1016/j.cor.2021.105424 · Cited by 88
Gerards, A. M. H. (1995) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(05)80120-3 · Cited by 88
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Orlin, J. B., Madduri, K., Subramani, K., & Williamson, M. D. (2009) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2009.03.001 · Cited by 88
Strong formulations for network design problems with connectivity requirements
Magnanti, T. L., & Raghavan, S. (2005) · Networks · doi:10.1002/net.20046 · Cited by 88
Efficient implementation of graph algorithms using contraction
Gabow, H. N., Galil, Z., & Spencer, T. H. (1989) · Journal of the ACM · doi:10.1145/65950.65954 · Cited by 88
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
Tamir, A. (1988) · SIAM Journal on Discrete Mathematics · doi:10.1137/0401038 · Cited by 88
On Minimizing the Impact of Mobility on Topology Control in Mobile Ad Hoc Networks
Nishiyama, H., Ngo, T., Ansari, N., & Kato, N. (2012) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2012.010312.110783 · Cited by 87
Towards a Final Analysis of Pairing Heaps
Pettie, S. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.75 · Cited by 86
Constructing nested bases approximations from the entries of non-local operators
Bebendorf, M., & Venn, R. (2012) · Numerische Mathematik · doi:10.1007/s00211-012-0449-9 · Cited by 86
Mobile-to-mobile energy replenishment in mission-critical robotic sensor networks
He, L., Cheng, P., Gu, Y. J., Pan, J., Zhu, T., & Liu, C. (2014) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2014.6848051 · Cited by 86
An algorithm for finding the k quickest paths in a network
Chen, Y. (1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90096-2 · Cited by 86
Improved algorithms for the k simple shortest paths and the replacement paths problems
Gotthilf, Z., & Lewenstein, M. (2008) · Information Processing Letters · doi:10.1016/j.ipl.2008.12.015 · Cited by 86
Multiple-Source Shortest Paths in Embedded Graphs
Cabello, S., Chambers, E. W., & Erickson, J. (2013) · SIAM Journal on Computing · doi:10.1137/120864271 · Cited by 86
Minimum-cost QoS multicast and unicast routing in communication networks
Xue, G. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.811420 · Cited by 86
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Fredman, M. L., & Willard, D. E. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89594 · Cited by 85
Self-citationUndirected single source shortest paths in linear time
Thorup, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646088 · Cited by 85
Image Phylogeny by Minimal Spanning Trees
Dias, Z., Rocha, A., & Goldenstein, S. K. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2169959 · Cited by 84
Planar graph decomposition and all pairs shortest paths
Frederickson, G. N. (1991) · Journal of the ACM · doi:10.1145/102782.102788 · Cited by 84
Hiding the Access Pattern is Not Enough: Exploiting Search Pattern Leakage in Searchable EncryptionPreprint
Oya, S., & Kerschbaum, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.03465 · Cited by 83
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Berkholz, C., Bonsma, P., & Grohe, M. (2016) · Theory of Computing Systems · doi:10.1007/s00224-016-9686-0 · Cited by 82
Highway Dimension and Provably Efficient Shortest Path Algorithms
Abraham, I., Delling, D., Fiat, A., Goldberg, A. V., & Werneck, R. F. (2016) · Journal of the ACM · doi:10.1145/2985473 · Cited by 82
Approximating Maximum Weight Matching in Near-Linear Time
Duan, R., & Pettie, S. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.70 · Cited by 81
Near-shortest and K-shortest simple paths
Carlyle, W. M., & Wood, R. K. (2005) · Networks · doi:10.1002/net.20077 · Cited by 81
Stergiopoulos, G., Dedousis, P., & Gritzalis, D. A. (2021) · International Journal of Information Security · doi:10.1007/s10207-020-00533-4 · Cited by 81
Sharma, A., Rathee, G., Kumar, R., Saini, H., Varadarajan, V., Nam, Y., & Chilamkurti, N. (2019) · Sensors · doi:10.3390/s19092119 · Cited by 80
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Pacheco, J., Caballero, R., Laguna, M., & Molina, J. (2012) · Transportation Science · doi:10.1287/trsc.1120.0437 · Cited by 80
Costly Circuits, Submodular Schedules and Approximate Carathéodory Theorems
Venkatakrishnan, S. B., Alizadeh, M., & Viswanath, P. (2016) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/2896377.2901479 · Cited by 80
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
Meyer, U. (2001) · Max Planck Institute for Plasma Physics · doi:10.5555/365411.365784 · Cited by 80
Computing shortest paths with comparisons and additions
Pettie, S., & Ramachandran, V. (2002) · Symposium on Discrete Algorithms · doi:10.5555/545381.545417 · Cited by 80
Chen, B. Y., Lam, W. H. K., Li, Q., Sumalee, A., & Yan, K. (2013) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2013.2270282 · Cited by 79
Sedeño‐Noda, A., & Raith, A. (2014) · Computers & Operations Research · doi:10.1016/j.cor.2014.11.010 · Cited by 79
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.