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 901–1,000 of 3,140
Efficient algorithms for path problems in weighted graphs
Blelloch, G. E., & Williams, V. V. (2008) · Cited by 21
Connected domination and Steiner set on weighted permutation graphs
Arvind, K., & Regan, C. P. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90183-v · Cited by 21
An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths
Han, Y. (2006) · Lecture notes in computer science · doi:10.1007/11841036_38 · Cited by 21
A route pre-computation algorithm for integrated services networks
Boudec, J. L., & Przygienda, T. (1995) · Journal of Network and Systems Management · doi:10.1007/bf02139533 · Cited by 21
Dominant Reaction Pathways by Quantum Computing
Hauke, P., Mattiotti, G., & Faccioli, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.028104 · Cited by 20
A Receding Horizon Multi-Objective Planner for Autonomous Surface Vehicles in Urban Waterways
Shan, T., Wang, W., Englot, B., Ratti, C., & Rus, D. L. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9304298 · Cited by 20
Li, Z., Li, G., Xu, Z., & Chen, A. (2023) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2023.103210 · Cited by 20
Engelken, R. (2023) · neural information processing systems · doi:10.52202/075280-0161 · Cited by 20
The Contention Avoiding Concurrent Priority Queue
Sagonas, K., & Winblad, K. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-52709-3_23 · Cited by 20
Valuation Compressions in VCG-Based Combinatorial Auctions
Dütting, P., Henzinger, M. R., & Starnberger, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-45046-4_13 · Cited by 20
Capacity-Constrained Network-Voronoi Diagram: A Summary of Results
Yang, K., Shekhar, A. H., Oliver, D., & Shekhar, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40235-7_4 · Cited by 20
Quake Heaps: A Simple Alternative to Fibonacci Heaps
Chan, T. M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40273-9_3 · Cited by 20
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
Williams, V. V. (2010) · ACM Transactions on Algorithms · doi:10.1145/1824777.1824790 · Cited by 20
An overview of discrete event simulation methodologies and implementation
Mansharamani, R. K. (1997) · Sadhana · doi:10.1007/bf02802549 · Cited by 20
Finding K shortest looping paths with waiting time in a time–window network
Yang, H.-H., & Chen, Y. (2005) · Applied Mathematical Modelling · doi:10.1016/j.apm.2005.05.005 · Cited by 20
SCARE: A Case Study with Baghdad
Shakarian, P., Subrahmanian, V. S., & Maria, L. S. (2009) · Institutional Research Information System University of Turin (University of Turin) · Cited by 20
Biswas, P., Goel, M., Negi, H., & Datta, M. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.07.376 · Cited by 20
Minimum-Cost Flows in Unit-Capacity Networks
Goldberg, A. V., Hed, S., Kaplan, H. Y., & Tarjan, R. E. (2017) · Theory of Computing Systems · doi:10.1007/s00224-017-9776-7 · Cited by 20
Self-citationStabilizing Boolean networks by optimal event-triggered feedback control
Zhu, Q., & Lin, W. (2019) · Systems & Control Letters · doi:10.1016/j.sysconle.2019.03.002 · Cited by 20
An efficient parallel algorithm for shortest paths in planar layered digraphs
Subramanian, S., Tamassia, R., & Vitter, J. S. (1995) · Algorithmica · doi:10.1007/bf01294130 · Cited by 20
Learner interaction with algorithm visualizations: viewing vs. changing vs. constructing
Lauer, T. (2006) · ACM SIGCSE Bulletin · doi:10.1145/1140123.1140179 · Cited by 20
Kalyanasundaram, B., & Pruhs, K. R. (1991) · Symposium on Discrete Algorithms · doi:10.5555/127787.127831 · Cited by 20
Lossless image compression with a codebook of block scans
Memon, N. D., Sayood, K., & Magliveras, S. S. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.363149 · Cited by 20
Making distributed spanning tree algorithms fault-resilient
Bar-Yehuda, R., Kutten, S., Wolfstahl, Y., & Zaks, S. (2006) · Springer eBooks · doi:10.1007/bfb0039625 · Cited by 20
QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs
Xue, G., Chen, L., & Thulasiraman, K. (2003) · International Conference on Communications · doi:10.1109/icc.2002.997346 · Cited by 20
Fast geometric approximation techniques and geometric embedding problems
Bern, M. W., Karloff, H. J., Raghavan, P., & Schieber, B. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90252-b · Cited by 20
Optimal two-terminal α-β wire routing
Cohoon, J. P., & Richards, D. (1988) · Integration · doi:10.1016/0167-9260(88)90017-x · Cited by 20
Algorithms and data structures for cache-efficient computation: theory and experimental evaluation
Ramachandran, V., & Chowdhury, R. (2007) · Texas ScholarWorks (Texas Digital Library) · Cited by 20
Big graphs: challenges and opportunities
Fan, W. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3554821.3554899 · Cited by 19
A quantum algorithm that deletes marked states from an arbitrary database
Liu, Y., & Ouyang, X. (2013) · Chinese Science Bulletin · doi:10.1007/s11434-013-5885-0 · Cited by 19
Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games
Phalakarn, K., Takisaka, T., Haas, T., & Hasuo, I. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-53291-8_19 · Cited by 19
Parallel algorithms for the assignment and minimum-cost flow problems
Orlin, J. B., & Stein, C. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90068-r · Cited by 19
All-Pairs Shortest Paths in O(n²) Time with High Probability
Peres, Y., Sotnikov, D., Sudakov, B., & Zwick, U. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.69 · Cited by 19
Flight Planning in Free Route Airspaces
Jensen, C. K., Chiarandini, M., & Larsen, K. S. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.atmos.2017.14 · Cited by 19
Sharma, A., & Kumar, R. (2019) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-169968 · Cited by 19
Wide-Coverage Neural A* Parsing for Minimalist Grammars
Torr, J., Stanojević, M., Steedman, M. J., & Cohen, S. B. (2019) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p19-1238 · Cited by 19
Virtual mesh networking for achieving multi-hop D2D communications in 5G networks
Huang, C., Zhai, B., Tang, A., & Wang, X. (2019) · Ad Hoc Networks · doi:10.1016/j.adhoc.2019.101936 · Cited by 19
Optimal Oblivious Priority Queues
Jafargholi, Z., Larsen, K. G., & Simkin, M. (2021) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976465.141 · Cited by 19
Bermejo, I., García-Marco, I., & Salazar‐González, J. (2007) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2007.08.005 · Cited by 19
Reoptimizing the rural postman problem
Archetti, C., Guastaroba, G., & Speranza, M. G. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.12.010 · Cited by 19
Fast and fine quickest path algorithm
Sedeño‐Noda, A., & González-Barrera, J. D. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.04.028 · Cited by 19
An Approximation Algorithm for Time Optimal Multi-Robot Routing
Turpin, M., Michael, N., & Kumar, V. (2015) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-16595-0_36 · Cited by 19
A4SDN - Adaptive Alienated Ant Algorithm for Software-Defined Networking
Stefano, A. D., Cammarata, G., Morana, G., & Zito, D. (2015) · International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) · doi:10.1109/3pgcic.2015.120 · Cited by 19
Computing and Listing st-Paths in Public Transportation Networks
Böhmová, K., Häfliger, L., Mihaľák, M., Pröger, T., Sacomoto, G., & Sagot, M. (2017) · Theory of Computing Systems · doi:10.1007/s00224-016-9747-4 · Cited by 19
The weak-heap data structure: Variants and applications
Edelkamp, S., Elmasry, A., & Katajainen, J. (2012) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2012.04.010 · Cited by 19
An Efficient Algorithm for Minimum-Weight Bibranching
Keijsper, J., & Pendavingh, R. A. (1998) · Journal of Combinatorial Theory Series B · doi:10.1006/jctb.1998.1817 · Cited by 19
The point-to-point connection problem — analysis and algorithms
Natu, M., & Fang, S. (1997) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(97)00010-3 · Cited by 19
A parallel priority data structure with applications
Brodal, G. S., Träff, J. L., & Zaroliagis, C. (2002) · International Parallel Processing Symposium · doi:10.1109/ipps.1997.580979 · Cited by 19
Fast and Exact Shortest Path Queries Using Highway Hierarchies
Schultes, D., Hölzer, M., Matijević, D., & Schulz, F. (2005) · Cited by 19
Optimal lightpath routing and rerouting in WDM networks
Xue, G. (2002) · Globecom · doi:10.1109/glocom.2001.966156 · Cited by 19
A new approach to all pairs shortest paths in planar graphs
Frederickson, G. N. (1987) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/28395.28398 · Cited by 19
Center problems with pos/neg weights on trees
Burkard, R. E., & Dollani, H. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00211-4 · Cited by 19
Calculating the meeting point of scattered robots on weighted terrain surfaces
Lanthier, M. A., Nussbaum, D., & Wang, T.-J. (2005) · Cited by 19
A tight lower bound on the size of visibility graphs
Shen, X., & Edelsbrunner, H. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90038-x · Cited by 19
Xue, G., Chen, L., & Thulasiraman, K. (2003) · Globecom · doi:10.1109/glocom.2002.1189118 · Cited by 19
Reconstructing a history of recombinations from a set of sequences
Kececioglu, J. D., & Gusfield, D. (1994) · Symposium on Discrete Algorithms · doi:10.5555/314464.314626 · Cited by 19
Engineering shortest paths and layout algorithms for large graphs
Willhalm, T. (2005) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000003385 · Cited by 19
Fast Marching Methods in path and motion planning: improvements and high-level applications
González, G., & Victorio, J. (2015) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 19
Computational topology of graphs on surfacesPreprint
de Verdière, É. C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.05358 · Cited by 19
Greco, R., Barca, E., Raumonen, P., Persia, M., & Tartarino, P. (2023) · International Journal of Applied Earth Observation and Geoinformation · doi:10.1016/j.jag.2023.103426 · Cited by 18
Ma, Y., Yang, X., Sun, Q., & Zhao, Y. (2023) · Journal of Optical Communications and Networking · doi:10.1364/jocn.496417 · Cited by 18
On convex decision regions in deep network representations
Tětková, L., Brüsch, T., Dorszewski, T., Mager, F. M., Aagaard, R. Ø., Foldager, J., Alstrøm, T. S., & Hansen, L. K. (2025) · Nature Communications · doi:10.1038/s41467-025-60809-y · Cited by 18
Algorithms for topology-free and alignment network queries
Pinter, R. Y., & Zehavi, M. (2014) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2014.03.002 · Cited by 18
Approximate labelled subtree homeomorphism
Pinter, R. Y., Rokhlenko, O., Tsur, D., & Ziv-Ukelson, M. (2007) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2007.07.001 · Cited by 18
Complexity of Shift Bribery in Committee Elections
Bredereck, R., Faliszewski, P., Niedermeier, R., & Talmon, N. (2021) · ACM Transactions on Computation Theory · doi:10.1145/3470647 · Cited by 18
Leveraging QoE Heterogenity for Large-Scale Livecaset Scheduling
Zhang, R.-X., Ma, M., Huang, T., Li, H., Liu, J., & Sun, L. (2020) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3394171.3413918 · Cited by 18
Kim, H., & Kim, B. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.07.023 · Cited by 18
Ranked enumeration of join queries with projections
Deep, S., Hu, X., & Koutris, P. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3510397.3510401 · Cited by 18
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances
Abdollahi, N., Jeusset, L., de Septenville, A. L., Davi, F., & Bernardes, J. (2023) · BMC Bioinformatics · doi:10.1186/s12859-022-05112-z · Cited by 18
All-pairs shortest paths in O ( n 2 ) time with high probability
Peres, Y., Sotnikov, D., Sudakov, B., & Zwick, U. (2013) · Journal of the ACM · doi:10.1145/2508028.2505988 · Cited by 18
The minmax regret robust shortest path problem in a finite multi-scenario model
Pascoal, M., & Resende, M. (2014) · Applied Mathematics and Computation · doi:10.1016/j.amc.2014.04.076 · Cited by 18
Costly Circuits, Submodular Schedules and Approximate Carathéodory Theorems
Venkatakrishnan, S. B., Alizadeh, M., & Viswanath, P. (2016) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2964791.2901479 · Cited by 18
A Constructive Arboricity Approximation Scheme
Blumenstock, M., & Fischer, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-38919-2_5 · Cited by 18
Using FastMap to Solve Graph Problems in a Euclidean Space
Li, J., Felner, A., Koenig, S., & Kumar, T. K. S. (2019) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v29i1.3488 · Cited by 18
Performance improvements of differential operators code for MPS method on GPU
Murotani, K., Masaie, I., Matsunaga, T., Koshizuka, S., Shioya, R., Ogino, M., & FUJISAWA, T. (2015) · Computational Particle Mechanics · doi:10.1007/s40571-015-0059-2 · Cited by 18
Scaling Algorithms for Weighted Matching in General Graphs
Duan, R., Pettie, S., & Su, H.-H. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.50 · Cited by 18
All-pairs shortest paths with a sublinear additive error
Roditty, L., & Shapira, A. (2011) · ACM Transactions on Algorithms · doi:10.1145/2000807.2000813 · Cited by 18
Approximation algorithms for shortest descending paths in terrains
Ahmed, M., Das, S., Lodha, S., Lubiw, A., Maheshwari, A., & Roy, S. (2009) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2009.05.001 · Cited by 18
Nagamochi, H. (2008) · Algorithmica · doi:10.1007/s00453-008-9239-2 · Cited by 18
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
Eppstein, D., Goodrich, M. T., & Strash, D. (2010) · SIAM Journal on Computing · doi:10.1137/090759112 · Cited by 18
Okunuki, K. (2000) · GeoJournal · doi:10.1023/a:1014262530372 · Cited by 18
ODOMATRIX. Calcul de distances routières intercommunales
Hilal, M. (2010) · NOV AE - Ingénierie et savoir-faire innovants · Cited by 18
Average-case complexity of shortest-paths problems in the vertex-potential model
Cooper, C., FRIEZE, A. M., Mehlhorn, K., & Priebe, V. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63248-4_2 · Cited by 18
Iuriservice II: ontology development and architectural design
Casanovas, P., Casellas, N., Vallbé, J., Poblet, M., Ramos, F., Gorroñogoitia, J., Contreras, J., Blázquez, M., & Benjamins, R. (2005) · International Conference on Artificial Intelligence and Law · doi:10.1145/1165485.1165514 · Cited by 18
An evaluation of concurrent priority queue algorithms
Huang, Q., & Weihl, W. E. (2002) · IEEE Symposium on Parallel and Distributed Processing (SPDP) · doi:10.1109/spdp.1991.218255 · Cited by 18
Scheduling Classes on a College Campus
Fizzano, P., & Swanson, S. (2000) · Computational Optimization and Applications · doi:10.1023/a:1008720430012 · Cited by 18
Routing with many additive QoS constraints
Xue, G., Sen, A., & Banka, R. (2004) · International Conference on Communications · doi:10.1109/icc.2003.1204174 · Cited by 18
Geometric algorithms for the minimum cost assignment problem
Tokuyama, T., & Nakano, J. (1995) · Random Structures and Algorithms · doi:10.1002/rsa.3240060403 · Cited by 18
Chen, H., Campbell, A. M., Thomas, B. W., & Tamir, A. (2009) · Networks · doi:10.1002/net.20313 · Cited by 18
The relaxed min-max heap: A mergeable double-ended priority queue
Ding, Y., & Weiss, M. A. (1993) · Acta Informatica · doi:10.1007/bf01179371 · Cited by 18
A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
Klein, P. N., & Subramanian, S. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57155-8_269 · Cited by 18
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
Frederickson, G. N., & Srinivas, M. A. (1989) · SIAM Journal on Computing · doi:10.1137/0218008 · Cited by 18
Efficient algorithms for path problems with general cost criteria
Lengauer, T., & Theune, D. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54233-7_144 · Cited by 18
Brodal, G. S. (1995) · BRICS Report Series · doi:10.7146/brics.v2i12.19515 · Cited by 18
Learner interaction with algorithm visualizations: viewing vs. changing vs. constructing
Lauer, T. (2006) · ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE) · doi:10.1145/1140124.1140179 · Cited by 18
Scaling algorithms for approximate and exact maximum weight matchingPreprint
Duan, R., Pettie, S., & Su, H.-H. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.0790 · Cited by 18
Design and analysis of sequential and parallel single-source shortest-paths algorithms
Meyer, U. (2002) · Max Planck Institute for Plasma Physics · doi:10.22028/d291-25720 · Cited by 18
Data structures and amortized complexity in a functional setting
Schoenmakers, L. B. (1992) · TU/e Research Portal · doi:10.6100/ir381310 · Cited by 18
Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm
Filtser, A. (2019) · SIAM Journal on Computing · doi:10.1137/18m1184400 · Cited by 17
Enabling Heterogeneous Network Function Chaining
Cui, L., Tso, F. P., Guo, S., Weijia Jia, B., Wei, K., & Zhao, W. (2018) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2018.2871845 · Cited by 17
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.