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 701–800 of 3,140
On-line and dynamic algorithms for shortest path problems
Djidjev, H. N., Pantziou, G. E., & Zaroliagis, C. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59042-0_73 · Cited by 31
An experimental study of priority queues in external memory
Brengel, K., Crauser, A., Ferragina, P., & Meyer, U. (2000) · ACM Journal of Experimental Algorithmics · doi:10.1145/351827.384259 · Cited by 31
Searching Among Intervals and Compact Routing Tables
Frederickson, G. N. (1996) · Algorithmica · doi:10.1007/bf01955044 · Cited by 31
Resource constrained shortest paths and extensions
Garcia, R. (2009) · SMARTech Repository (Georgia Institute of Technology) · Cited by 31
Privacy-preserving parallel computations for graph problems
Anagreh, M. (2023) · DSpace repository (University of Tartu) · Cited by 31
On workflow aware location-based service composition for personal trip planning
Xu, J., Chen, J., Zhou, R. H., Fang, J., & Chengfei Liu, A. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.03.010 · Cited by 30
Bottin, M., & Rosati, G. (2019) · Robotics · doi:10.3390/robotics8040101 · Cited by 30
Parametric Shortest-Path Algorithms via Tropical Geometry
Joswig, M., & Schröter, B. (2022) · Mathematics of Operations Research · doi:10.1287/moor.2021.1199 · Cited by 30
Generalised time-dependent graphs for fully multimodal journey planning
Hrnčíř, J., & Jakob, M. (2013) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2013.6728545 · Cited by 30
Analyzing milestoning networks for molecular kinetics: Definitions, algorithms, and examples
Viswanath, S., Kreuzer, S. M., Cárdenas, A. E., & Elber, R. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4827495 · Cited by 30
Nien, C., Chang, L.-C., Ye, J.-H., Su, V., Wu, C.-H. W., & Kuan, C.-H. (2017) · Journal of Vacuum Science & Technology B Nanotechnology and Microelectronics Materials Processing Measurement and Phenomena · doi:10.1116/1.5001686 · Cited by 30
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
Pettie, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45465-9_9 · Cited by 30
The Bounded Cycle-Cover Problem
Hochbaum, D. S., & Olinick, E. V. (2001) · INFORMS journal on computing · doi:10.1287/ijoc.13.2.104.10516 · Cited by 30
The absolute center of a network
Dvir, D., & Handler, G. Y. (2004) · Networks · doi:10.1002/net.10108 · Cited by 30
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
Träff, J. L., & Zaroliagis, C. (2000) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1646 · Cited by 30
A general technique for implementation of efficient priority queues
Hoyer, P. (2002) · Israel Symposium on Theory and Computing Systems (ISTCS) · doi:10.1109/istcs.1995.377045 · Cited by 30
A simpler and faster strongly polynomial algorithm for generalized flow maximization
Olver, N., & Végh, L. A. (2017) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055439 · Cited by 29
Popular route planning with travel cost estimation from trajectories
Liu, H., Jin, C., & Zhou, A. (2018) · Frontiers of Computer Science · doi:10.1007/s11704-018-7249-z · Cited by 29
Incremental Graph Computations: Doable and Undoable
Fan, W., & Tian, C. (2022) · ACM Transactions on Database Systems · doi:10.1145/3500930 · Cited by 29
An analysis of one-to-one matching algorithms for entity resolution
Papadakis, G., Efthymiou, V., Thanos, E., Hassanzadeh, O., & Christen, P. (2023) · The VLDB Journal · doi:10.1007/s00778-023-00791-3 · Cited by 29
Minimization of travel time and weighted number of stops in a traffic-light network
Chen, Y., & Yang, H.-H. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00148-0 · Cited by 29
Haeupler, B., Sen, S., & Tarjan, R. E. (2011) · SIAM Journal on Computing · doi:10.1137/100785351 · Cited by 29
Self-citationShortest-path feasibility algorithms: An experimental evaluation
Cherkassky, B. V., Georgiadis, L., Goldberg, A. V., Tarjan, R. E., & Werneck, R. F. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1498698.1537602 · Cited by 29
Self-citationDirect graph -partitioning with a Kernighan–Lin like heuristic
Träff, J. L. (2005) · Operations Research Letters · doi:10.1016/j.orl.2005.10.003 · Cited by 29
Fast assessment of CO2 plume characteristics using a connectivity based proxy
Jeong, H., & Srinivasan, S. (2016) · International journal of greenhouse gas control · doi:10.1016/j.ijggc.2016.03.001 · Cited by 29
Chechik, S., Cohen, E., & Kaplan, H. Y. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.approx-random.2015.659 · Cited by 29
Efficient Algorithms with Asymmetric Read and Write Costs
Blelloch, G. E., Fineman, J. T., Gibbons, P. B., Gu, Y., & Shun, J. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2016.14 · Cited by 29
Discretization results for the Huff and Pareto-Huff competitive location models on networks
Peeters, P. H., & Plastria, F. (1998) · Top · doi:10.1007/bf02564790 · Cited by 29
Concave Generalized Flows with Applications to Market Equilibria
Végh, L. A. (2013) · Mathematics of Operations Research · doi:10.1287/moor.2013.0623 · Cited by 29
Fault tolerance in TCAM-limited software defined networks
Mohan, P., Truong-Huu, T., & Gurusamy, M. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.02.009 · Cited by 29
Strongly polynomial time algorithms for certain concave minimization problems on networks
Tụy, H., Dan, N. D., & Ghannadan, S. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90102-m · Cited by 29
Shortest path queries in digraphs of small treewidth
Chaudhuri, S., & Zaroliagis, C. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60084-1_78 · Cited by 29
Faster single-source shortest paths with negative real weights via proper hop distance
Huang, Y. P., Jin, P., & Quanrud, K. (2025) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978322.178 · Cited by 28
Virtual view networks for object reconstruction
Carreira, J., Kar, A., Tulsiani, S., & Malik, J. (2015) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2015.7298912 · Cited by 28
A bi-objective reliable path-finding algorithm for battery electric vehicle routing
Chen, X.-W., Chen, B. Y., Lam, W. H. K., Tam, M. L., & Ma, W. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115228 · Cited by 28
An auction-based weighted matching implementation on massively parallel architectures
Sathe, M., Schenk, O., & Burkhart, H. (2012) · Parallel Computing · doi:10.1016/j.parco.2012.09.001 · Cited by 28
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
Madani, O., Thorup, M., & Zwick, U. (2010) · ACM Transactions on Algorithms · doi:10.1145/1721837.1721849 · Cited by 28
Faster algorithm for optimum Steiner trees
Vygen, J. (2011) · Information Processing Letters · doi:10.1016/j.ipl.2011.08.005 · Cited by 28
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Hüffner, F., Komusiewicz, C., Moser, H., & Niedermeier, R. (2008) · Springer eBooks · doi:10.1007/978-3-540-78773-0_61 · Cited by 28
Lepri, D., Ábrahám, E., & Ölveczky, P. C. (2014) · Science of Computer Programming · doi:10.1016/j.scico.2014.06.006 · Cited by 28
Measuring and maximizing group closeness centrality over disk-resident graphs
Zhao, J., Lui, J. C. S., Towsley, D., & Guan, X. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2567948.2579356 · Cited by 28
Mahboubi, H., Masoudimansour, W., Aghdam, A. G., & Sayrafian, K. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2536800 · Cited by 28
Run-Time Recovery and Failure Analysis of Time-Triggered Traffic in Time Sensitive Networks
Kong, W., Nabi, M., & Goossens, K. G. W. (2021) · IEEE Access · doi:10.1109/access.2021.3092572 · Cited by 28
Approximate Parameterized Matching
Hazay, C., Lewenstein, M., & Sokol, D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30140-0_38 · Cited by 28
Chemical supply chain modeling for analysis of homeland security events
Ehlen, M. A., Sun, A. C.-T., Pepple, M. A., Eidson, E. D., & Jones, B. S. (2013) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2013.07.014 · Cited by 28
On the k-coloring of intervals
Carlisle, M. C., & Lloyd, E. L. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54029-6_157 · Cited by 28
Faster kinetic heaps and their use in broadcast scheduling
Kaplan, H. Y., Tarjan, R. E., & Tsioutsiouliklis, K. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365793 · Cited by 28
Self-citationOn the Cost of Interchange Rearrangement in Strings
Amir, A., Hartman, T., Kapah, O., Levy, A., & Porat, E. (2007) · Springer eBooks · doi:10.1007/978-3-540-75520-3_11 · Cited by 28
Finding the k Shortest Paths in Parallel
Ruppert, E. (2000) · Algorithmica · doi:10.1007/s004530010038 · Cited by 28
Random sampling in matroids, with applications to graph connectivity and minimum spanning trees
Karger, D. R. (1993) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1993.366879 · Cited by 28
Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking
Okasaki, C. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492666 · Cited by 28
Reinforcement Learning with A* and a Deep HeuristicPreprint
Keselman, A., Ten, S., Ghazali, A., & Jubeh, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.07745 · Cited by 28
Le, D. D., Zhou, F., & Molnár, M. (2014) · Journal of Optical Communications and Networking · doi:10.1364/jocn.7.000036 · Cited by 27
Automated Discovery of Cross-Plane Event-Based Vulnerabilities in Software-Defined Networking
Ujcich, B. E., Jero, S., Skowyra, R., Gomez, S. R., Bates, A., Sanders, W. H., & Okhravi, H. (2020) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24080 · Cited by 27
A Mobile Application for Real-Time Multimodal Routing Under a Set of Users’ Preferences
Gkiotsalitis, K., & Stathopoulos, A. (2014) · Journal of Intelligent Transportation Systems · doi:10.1080/15472450.2013.856712 · Cited by 27
Design and implementation of a parallel priority queue on many-core architectures
He, X. Q., Agarwal, D., & Prasad, S. K. (2012) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.1109/hipc.2012.6507490 · Cited by 27
System reliability of a stochastic-flow network through two minimal paths under time threshold
Lin, Y. (2009) · International Journal of Production Economics · doi:10.1016/j.ijpe.2009.11.033 · Cited by 27
Hybrid shortest path algorithm for vehicle navigation
Cho, H.-J., & Lan, C.-L. (2008) · The Journal of Supercomputing · doi:10.1007/s11227-008-0236-7 · Cited by 27
On personalized and sequenced route planning
Dai, J. M., Chengfei Liu, A., Xu, J., & Ding, Z. (2015) · World Wide Web · doi:10.1007/s11280-015-0352-2 · Cited by 27
Valuation Compressions in VCG-Based Combinatorial Auctions
Dütting, P., Henzinger, M. R., & Starnberger, M. (2018) · ACM Transactions on Economics and Computation · doi:10.1145/3232860 · Cited by 27
PittPatt Face Detection and Tracking for the CLEAR 2007 Evaluation
Nechyba, M. C., Brandy, L., & Schneiderman, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-68585-2_10 · Cited by 27
A fast parametric assignment algorithm with applications in max‐algebra
Gassner, E., & Klinz, B. (2009) · Networks · doi:10.1002/net.20288 · Cited by 27
All pairs lightest shortest paths
Zwick, U. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301271 · Cited by 27
On the spanning trees of weighted graphs
Mayr, E. W., & Plaxton, C. G. (1992) · COMBINATORICA · doi:10.1007/bf01305236 · Cited by 27
Lin, Y. (2010) · IEEE Transactions on Reliability · doi:10.1109/tr.2010.2040765 · Cited by 27
A new improvement for a K shortest paths algorithm
Martins, E. D. Q. V., Pascoal, M., & Santos, J. L. (2001) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · Cited by 27
Practical and effective IR-style keyword search over semantic web
Ning, X., Jin, H., Weijia Jia, B., & Yuan, P. (2009) · Information Processing & Management · doi:10.1016/j.ipm.2008.12.005 · Cited by 27
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
Shigeno, M., Iwata, S., & McCormick, S. T. (2000) · Mathematics of Operations Research · doi:10.1287/moor.25.1.76.15208 · Cited by 27
Improved lightpath (wavelength) routing in large WDM networks
Liang, W., & Shen, X. (2000) · IEEE Transactions on Communications · doi:10.1109/26.870024 · Cited by 27
Mehlhorn, K., & Tsakalidis, A. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50011-4 · Cited by 27
Graphs of Convex Sets with Applications to Optimal Control and Motion Planning
Marcucci, T. (2024) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 27
Li, S. (2022) · Mathematical Biosciences & Engineering · doi:10.3934/mbe.2022502 · Cited by 26
Jiang, J., Li, Y., Zhang, X., Yu, M., Lee, C., & Hong, S. H. (2023) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2023.100464 · Cited by 26
Cong, J., Fan, Y., & Xu, J. (2009) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/1529255.1529257 · Cited by 26
Toward space-time buffering for spatiotemporal proximity analysis of movement data
Yuan, H., Chen, B. Y., Li, Q., Shaw, S., & Lam, W. H. K. (2018) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2018.1432862 · Cited by 26
Dynamic Pricing in Smart Grids Under Thresholding Policies
Almahmoud, Z., Crandall, J. W., Elbassioni, K., Nguyen, T. T., & Roozbehani, M. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2018.2825997 · Cited by 26
Adoni, W. Y. H., Nahhal, T., Aghezzaf, B., & Elbyed, A. (2018) · Journal Of Big Data · doi:10.1186/s40537-018-0125-8 · Cited by 26
Incremental Network Design with Minimum Spanning Trees
Engel, K., Kalinowski, T., & Savelsbergh, M. W. P. (2017) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00423 · Cited by 26
Tunable QoS-Aware Network Survivability
Yallouz, J., & Orda, A. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2606342 · Cited by 26
SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
Ferone, D., Festa, P., Napoletano, A., & Pastore, T. (2017) · Pesquisa Operacional · doi:10.1590/0101-7438.2017.037.03.0487 · Cited by 26
A Constrained Shortest Path Scheme for Virtual Network Service Management
Chemodanov, D., Esposito, F., Calyam, P. P., & Sukhov, A. M. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2018.2865204 · Cited by 26
Williams, V. V. (2011) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973082.102 · Cited by 26
Elkin, M., & Neiman, O. (2022) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2022.27 · Cited by 26
Hypergraph traversal revisited: Cost measures and dynamic algorithms
Ausiello, G., Italiano, G. F., & Nanni, U. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055754 · Cited by 26
A linear-time algorithm for finding a minimum spanning pseudoforest
Gabow, H. N., & Tarjan, R. E. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90089-0 · Cited by 26
Self-citationApproximate Labelled Subtree Homeomorphism
Pinter, R. Y., Rokhlenko, O., Tsur, D., & Ziv-Ukelson, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27801-6_5 · Cited by 26
Efficient Algorithms for the Hitchcock Transportation Problem
Tokuyama, T., & Nakano, J. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792236729 · Cited by 26
A shortest path approach to wireframe to solid model conversion
Bagali, S., & Waggenspack, W. (1995) · ACM Symposium on Solid Modeling and Applications · doi:10.1145/218013.218083 · Cited by 26
Shortest path algorithms for nearly acyclic directed graphs
Takaoka, T. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00292-2 · Cited by 26
Into the Square - On the Complexity of Quadratic-Time Solvable ProblemsPreprint
Borassi, M., Crescenzi, P., & Habib, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.4972 · Cited by 26
Fast and Simple Sorting Using Partial Information
Haeupler, B., Hladík, R., Iacono, J., Rozhoň, V., Tarjan, R. E., & Tětek, J. (2025) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611978322.134 · Cited by 25
Self-citationEfficient Nearly-Fair Division with Capacity Constraints
Shoshan, H., Hazon, N., & Segal-Halevi, E. (2023) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/kvxg2484 · Cited by 25
Regarding Goal Bounding and Jump Point Search
Hu, Y., Harabor, D., Qin, L., & Yin, Q. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12255 · Cited by 25
Automating incremental graph processing with flexible memoization
Gong, S., Tian, C., Yin, Q., Yu, W., Zhang, Y., Geng, L., Yu, S., Yu, G., & Zhou, J. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3461535.3461550 · Cited by 25
Hong, S., Hwang, I., & Jang, Y. J. (2022) · IEEE Transactions on Semiconductor Manufacturing · doi:10.1109/tsm.2022.3168702 · Cited by 25
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs
Duan, R., Mao, J., Shu, X., & Yin, L. (2023) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs57990.2023.00035 · Cited by 25
Festa, P. (2008) · Springer eBooks · doi:10.1007/978-0-387-30165-5_8 · Cited by 25
Predictive log-synchronization
Shalev, O., & Shavit, N. (2006) · European Conference on Computer Systems · doi:10.1145/1217935.1217965 · Cited by 25
Optimal routing policy of a stochastic-flow network
Lin, Y. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2008.09.002 · Cited by 25
Network Reliability of a Time-Based Multistate Network Under Spare Routing With $p$ Minimal Paths
Lin, Y. (2011) · IEEE Transactions on Reliability · doi:10.1109/tr.2010.2103594 · Cited by 25
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.