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,001–1,100 of 3,140
Cache-Efficient Fork-Processing Patterns on Large Graphs
Lu, S., Sun, S., Paul, J., Li, Y., & He, B. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3457253 · Cited by 17
Schweikert, A. E., L’Her, G., & Deinert, M. (2021) · Applied Network Science · doi:10.1007/s41109-021-00385-4 · Cited by 17
A Fast Approximation for Maximum Weight Matroid Intersection
Chekuri, C., & Quanrud, K. (2015) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974331.ch33 · Cited by 17
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
Abboud, A., Grandoni, F., & Williams, V. V. (2022) · ACM Transactions on Algorithms · doi:10.1145/3563393 · Cited by 17
Bi-objective reliable eco-routing considering uncertainties of travel time and fuel consumption
Teng, W., Chen, B. Y., Lam, W. H. K., Gong, W., Shi, C., & Tam, M. L. (2023) · Transportmetrica B Transport Dynamics · doi:10.1080/21680566.2023.2165192 · Cited by 17
Uniquely represented data structures with applications to privacy
Blelloch, G. E., & Golovin, D. (2008) · Cited by 17
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
Planken, L., Weerdt, M. M. D., & van der Krogt, R. (2011) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v21i1.13465 · Cited by 17
Thek-centrum shortest path problem
Garfinkel, R., Fernández, E., & Lowe, T. J. (2006) · Top · doi:10.1007/bf02837564 · Cited by 17
Human-centric panoramic imaging stitching
Ozawa, T., Kitani, K., & Koike, H. (2012) · Augmented Human International Conference · doi:10.1145/2160125.2160145 · Cited by 17
Locating service centers with precedence constraints
Kaufman, Y., & Tamir, A. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90130-g · Cited by 17
THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP
Elmasry, A. (2010) · Discrete Mathematics Algorithms and Applications · doi:10.1142/s1793830910000838 · Cited by 17
On the Cost of Interchange Rearrangement in Strings
Amir, A., Hartman, T., Kapah, O., Levy, A., & Porat, E. (2009) · SIAM Journal on Computing · doi:10.1137/080712969 · Cited by 17
Fast local search for the steiner problem in graphs
Uchoa, E., & Werneck, R. F. (2012) · ACM Journal of Experimental Algorithmics · doi:10.1145/2133803.2184448 · Cited by 17
Optimal design of thermally stable proteins
Bannen, R. M., Suresh, V., Phillips, G. N., Wright, S. J., & Mitchell, J. C. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn450 · Cited by 17
PRACTICAL EFFICIENCY OF THE LINEAR-TIME ALGORITHM FOR THE SINGLE SOURCE SHORTEST PATH PROBLEM
Asano, Y., & Imai, H. (2000) · Journal of the Operations Research Society of Japan · doi:10.15807/jorsj.43.431 · Cited by 17
Efficient computation of Lyapunov functions for Morse decompositions
Goullet, A., Harker, S., Mischaikow, K., Kalies, W. D., & Kasti, D. (2015) · Discrete and Continuous Dynamical Systems - B · doi:10.3934/dcdsb.2015.20.2419 · Cited by 17
Two-stage multicriteria georeferenced express analysis of new electric transmission line projects
Ekel, P., Lisboa, A. C., Pereira, J., Vieira, D. A. G., Silva, L. M. L., & D’Ângelo, M. F. S. V. (2019) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2019.01.008 · Cited by 17
Monge and feasibility sequences in general flow problems
Adler, I., Hoffman, A. J., & Ron Shamir, A. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90220-i · Cited by 17
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
Demetrescu, C., & Italiano, G. F. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45465-9_54 · Cited by 17
Kao, M., Lam, T., Sung, W.-K. K., & Ting, H. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63890-3_39 · Cited by 17
Switch-level simulation using dynamic graph algorithms
Adler, D. (1991) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.67788 · Cited by 17
Siachalou, S., & Georgiadis, L. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1208931 · Cited by 17
Transmissions in a network with capacities and delays
Kagaris, D., Pantziou, G. E., Tragoudas, S., & Zaroliagis, C. (1999) · Networks · doi:10.1002/(sici)1097-0037(199905)33:3<167::aid-net2>3.0.co;2-j · Cited by 17
Efficient algorithms for bipartite matching problems with preferences
Sng, C. T. S. (2008) · Enlighten: Theses (The University of Glasgow) · Cited by 17
Kronecker Algebra-based Deadlock Analysis for Railway Systems
Mittermayr, R., Blieberger, J., & Schöbel, A. (n.d.) · PROMET - Traffic&Transportation · doi:10.7307/ptt.v24i5.1171 · Cited by 17
Minimum cut in directed planar networks
Janiga, L., & Koubek, V. (1992) · Czech digital mathematics library · Cited by 17
A survey of exact and approximation algorithms for linear-parametric optimization problems
Nemesch, L., Ruzika, S., Thielen, C., & Wittmann, A. (2025) · Journal of Global Optimization · doi:10.1007/s10898-025-01512-6 · Cited by 16
Solving all-pairs shortest path by single-source computations: Theory and practice
Brodnik, A., & Grgurovič, M. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2017.03.008 · Cited by 16
Cloud-based Context-aware Mobile Applications and Framework for Hajj and Umrah Management
Elazhary, H. (2017) · International Journal of Computer Trends and Technology · doi:10.14445/22312803/ijctt-v47p115 · Cited by 16
Heywood, P., Maddock, S., Bradley, R., Swain, D., Wright, I., Mawson, M., Fletcher, G., Guichard, R., Himlin, R., & Richmond, P. (2019) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2019.05.020 · Cited by 16
Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers
Fazzone, A., Lanciano, T., Denni, R., Tsourakakis, C. E., & Bonchi, F. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3565838.3565843 · Cited by 16
Zhang, Z., & Li, M. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3299277 · Cited by 16
Koios: Top-k Semantic Overlap Set Search
Mundra, P., Zhang, J., Nargesian, F., & Augsten, N. (2023) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde55515.2023.00121 · Cited by 16
An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs
Mondal, S., Pal, M., & Pal, T. K. (2003) · Journal of Mathematical Modelling and Algorithms · doi:10.1023/a:1023695531209 · Cited by 16
Delineating Sea Level Rise Inundation Using a Graph Traversal Algorithm
Li, X., Grady, C. J., & Peterson, A. T. (2014) · Marine Geodesy · doi:10.1080/01490419.2014.902884 · Cited by 16
An improved genetic algorithm based on the shortest path problem
Liu, Z., Kong, Y., & Su, B. (2016) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2016.7831845 · Cited by 16
An Introduction to Proximity Graphs
Mathieson, L., & Moscato, P. (2019) · Springer eBooks · doi:10.1007/978-3-030-06222-4_4 · Cited by 16
Leguizamón, G., Blum, C., & Alba, E. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781351236423 · Cited by 16
Optimal Distribution of Traffic in Manhattan Road Networks for Minimizing Routing-Time
Sarma, S. S., Sinha, K., Sub-r-pa, C., Chakraborty, G., & Sinha, B. P. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.2994836 · Cited by 16
Adaptive Asynchronous Parallelization of Graph Algorithms
Fan, W., Lü, P., Yu, W., Xu, J., Yin, Q., Luo, X., Zhou, J., & Jin, R. (2020) · ACM Transactions on Database Systems · doi:10.1145/3397491 · Cited by 16
An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment
Asaduzzaman, M., Geok, T. K., Hossain, F., Sayeed, M. S., Abdaziz, A., Wong, H.-Y., Tso, C. P., Ahmed, S., & Bari, M. A. (2021) · Symmetry · doi:10.3390/sym13030421 · Cited by 16
A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem
Kuno, T., & Utsunomiya, T. (1997) · Journal of Global Optimization · doi:10.1023/a:1008278625289 · Cited by 16
Finding the Most Vital Node of a Shortest Path
Nardelli, E., Proietti, G., & Widmayer, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44679-6_31 · Cited by 16
A new separation algorithm for the Boolean quadric and cut polytopes
Letchford, A. N., & Sørensen, M. M. (2014) · Discrete Optimization · doi:10.1016/j.disopt.2014.07.002 · Cited by 16
Wang, I.-L., Tsai, Y. J., & Li, F. (2011) · Computers & Industrial Engineering · doi:10.1016/j.cie.2011.01.001 · Cited by 16
Techniques in Multimodal Shortest Path in Public Transport Systems
Lopez, D. L., & Lozano, A. (2014) · Transportation research procedia · doi:10.1016/j.trpro.2014.10.068 · Cited by 16
Efficient algorithms for minimum range cut problems
Katoh, N., & Iwano, K. (1994) · Networks · doi:10.1002/net.3230240705 · Cited by 16
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
Proietti, G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44691-5_18 · Cited by 16
Risk-Aware Routing for Optical Transport Networks
Xia, M., Tornatore, M., Martel, C. U., & Mukherjee, B. (2010) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2010.5462168 · Cited by 16
Finding the hidden path: time bounds for all-pairs shortest paths
Karger, D. R., Koller, D., & Phillips, S. J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1991.185419 · Cited by 16
Fredman, M. L. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48318-7_20 · Cited by 16
Self-citationComputing shortest cycles using universal covering space
Yin, X., Jin, M., & Gu, X. D. (2007) · The Visual Computer · doi:10.1007/s00371-007-0169-9 · Cited by 16
Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
Kolliopoulos, S. G., & Stein, C. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0937 · Cited by 16
Shortest path queries among weighted obstacles in the rectilinear plane
Chen, D. Z., Klenk, K. S., & Tu, H.-Y. (1995) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/220279.220319 · Cited by 16
Fast data transmission and maximal dynamic flow
Xue, G., Sun, S., & Rosen, J. B. (1998) · Information Processing Letters · doi:10.1016/s0020-0190(98)00047-7 · Cited by 16
Some new algorithms for location problems on networks
Peeters, P. H. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00185-9 · Cited by 16
From graphs to matrices, and back: new techniques for graph algorithms
Goemans, M. X., Kelner, J. A., & Mądry, A. (2011) · Cited by 16
Querying for Paths in Graphs using Context-Free Path QueriesPreprint
Hellings, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.02242 · Cited by 16
The energy-constrained quickest path problem
Calvete, H. I., del-Pozo, L., & Iranzo, J. A. (2016) · Optimization Letters · doi:10.1007/s11590-016-1073-x · Cited by 15
Teng, W., & Chen, B. Y. (2024) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2024.103635 · Cited by 15
Experimental quantum deletion in an NMR quantum information processor
Yu, L., Feng, G., Pearson, J., & Long, G. (2014) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-014-5494-1 · Cited by 15
Algorithm 1015: A Fast Scalable Solver for the Dense Linear (Sum) Assignment Problem
Guthe, S., & Thuerck, D. (2021) · ACM Transactions on Mathematical Software · doi:10.1145/3442348 · Cited by 15
Multicommodity routing optimization for engineering networks
Lonardi, A., Putti, M., & Bacco, C. D. (2022) · Scientific Reports · doi:10.1038/s41598-022-11348-9 · Cited by 15
Transit Voronoi diagrams in multi-mode public transport networks
Chen, B. Y., Teng, W., Jia, T., Chen, H., & Liu, X. (2022) · Computers Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2022.101849 · Cited by 15
Shielding Graph for eXact Analytics With SGX
Du, M., Jiang, P., Wang, Q., Chow, S. S. M., & Zhao, L. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3241164 · Cited by 15
Deep Reinforcement Learning Based Cross-Layer Design in Terahertz Mesh Backhaul Networks
Hu, Z., Han, C. Z., & Wang, X. (2023) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2023.3342837 · Cited by 15
Takaoka, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03816-7_59 · Cited by 15
Eneh, A. N., & Arinze, U. C. (2017) · Nigerian Journal of Technology · doi:10.4314/njt.v36i3.30 · Cited by 15
Overlaying Conditional Circuit Clauses for Secure Computation
Kennedy, W. S., Kolesnikov, V., & Wilfong, G. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70697-9_18 · Cited by 15
A Hierarchical Route Guidance Framework for Off-Road Connected Vehicles
Roy, J., Wan, N., Goswami, A., Vahidi, A., Jayakumar, P., & Zhang, C. (2018) · Journal of Dynamic Systems Measurement and Control · doi:10.1115/1.4038905 · Cited by 15
Minimum-Cost Heterogeneous Node Placement in Wireless Sensor Networks
Sun, Y., & Halgamuge, S. K. (2019) · IEEE Access · doi:10.1109/access.2019.2894117 · Cited by 15
Fast Approximation of Centrality
Eppstein, D., & Wang, J. (2006) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812773289_0004 · Cited by 15
Fast C-K-R Partitions of Sparse Graphs
Mendel, M., & Schwob, C. (2009) · Chicago Journal of Theoretical Computer Science · Cited by 15
Single-machine scheduling problem with total energy consumption costs minimization
Aghelinejad, M. M., Ouazène, Y., & Yalaoui, A. (2019) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2019.11.087 · Cited by 15
Design of switching multilinear model predictive control using gap metric
Park, B. J., Kim, Y., & Lee, J. M. (2021) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2021.107317 · Cited by 15
Kim, J., Han, W.-S., Oh, J., Kim, S., & Yu, H. (2013) · Information Sciences · doi:10.1016/j.ins.2013.07.009 · Cited by 15
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Clímaco, J., & Pascoal, M. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2009.01.002 · Cited by 15
Walking on Minimax Paths for k-NN Search
Kim, K.-H., & Choi, S. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8588 · Cited by 15
A new approach for the multiobjective minimum spanning tree
Santos, J. L., Pugliese, L. D. P., & Guerriero, F. (2018) · Computers & Operations Research · doi:10.1016/j.cor.2018.05.007 · Cited by 15
Aghelinejad, M. M., Ouazène, Y., & Yalaoui, A. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.08.468 · Cited by 15
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems
Filtser, A., Krauthgamer, R., & Trabelsi, O. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.sosa.2019.10 · Cited by 15
Robust routing in wide-area WDM networks
Liang, W. (2002) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2001.924946 · Cited by 15
Improved shortest path algorithms for nearly acyclic graphs
Saunders, S., & Takaoka, T. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00613-8 · Cited by 15
On graphs preserving rectilinear shortest paths in the presence of obstacles
Widmayer, P. (1991) · Annals of Operations Research · doi:10.1007/bf02067242 · Cited by 15
Abuaiadh, D., & Kingston, J. H. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58325-4_210 · Cited by 15
Kavvadias, D. J., Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. (1996) · Theoretical Computer Science · doi:10.1016/s0304-3975(96)00065-5 · Cited by 15
Lossless compression of RGB color images
Memon, N. D., & Sayood, K. (1995) · Optical Engineering · doi:10.1117/12.203128 · Cited by 15
Solving the shortest-paths problem on bipartite permutation graphs efficiently
Chen, L. (1995) · Information Processing Letters · doi:10.1016/0020-0190(95)00084-p · Cited by 15
Fully Realistic Multi-Criteria Timetable Information Systems
Schnee, M. (2009) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00001989 · Cited by 15
Algorithms for Simple Temporal Reasoning
Planken, L. (2013) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:2e41be6a-5220-421c-bef8-bbb8f91c128f · Cited by 15
Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems
Hüffner, F. (2007) · Common Library Network (Der Gemeinsame Bibliotheksverbund) · Cited by 15
Dijkstras algorithm with predictions to solve the single-source many-targets shortest-path problemPreprint
Feijen, W., & Schäfer, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.11927 · Cited by 15
Advances in quantum algorithms for the shortest path problemPreprint
Wesołowski, A., & Piddock, S. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2408.10427 · Cited by 15
Learning-Augmented Priority Queues
Benomar, Z., & Coester, C. (2024) · neural information processing systems · doi:10.52202/079017-3945 · Cited by 14
Mondelli, M., Zhou, Q., Lottici, V., & Ma, X. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.020914.130669 · Cited by 14
Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs
Janiak, A., Janiak, W., & Januszkiewicz, R. (2009) · Bulletin of the Polish Academy of Sciences Technical Sciences · doi:10.2478/v10175-010-0122-3 · Cited by 14
Massively parallel computation of globally optimal shortest paths with curvature penalization
Mirebeau, J., Gayraud, L., Barrère, R., Chen, D., & Desquilbet, F. (2022) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.7472 · Cited by 14
A scalable architecture for reprioritizing ordered parallelism
Posluns, G., Zhu, Y., Zhang, G., & Jeffrey, M. C. (2022) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3470496.3527387 · Cited by 14
Wang, H., Rodríguez-Fernandez, A. E., Uribe, L., Deutz, A. H., Cortés-Piña, O., & Schütze, O. (2024) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2024.3469373 · Cited by 14
FGNG: A fast multi-dimensional growing neural gas implementation
Mendes, C. A. T., Gattass, M., & Lopes, H. (2013) · Neurocomputing · doi:10.1016/j.neucom.2013.08.033 · Cited by 14
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.