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,301–1,400 of 3,140
Local network Voronoi diagrams
Nutanong, S. Y., Tanin, E., Ali, M. E., & Kulik, L. (2010) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/1869790.1869808 · Cited by 10
An extension of the bipartite weighted matching problem
Hsieh, A.-J., Ho, C.-W., & Fan, K. (1995) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)00106-d · Cited by 10
Optimal contours for high-order derivatives
Bornemann, F. A., & Wechslberger, G. (2012) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drs030 · Cited by 10
A generalized partite-graph method for transportation data association
Anderson, P., & Farooq, B. (2017) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2017.01.004 · Cited by 10
On the shortest path problem with negative cost cycles
Pugliese, L. D. P., & Guerriero, F. (2015) · Computational Optimization and Applications · doi:10.1007/s10589-015-9773-1 · Cited by 10
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Williams, V. V. (2008) · Symposium on Discrete Algorithms · Cited by 10
Efficient parallel algorithms for shortest paths in planar digraphs
Pantziou, G. E., Spirakis, P. G., & Zaroliagis, C. (1992) · BIT Numerical Mathematics · doi:10.1007/bf01994878 · Cited by 10
All-pairs-shortest-length on strongly chordal graphs
Balachandhran, V., & Rangan, C. P. (1996) · Discrete Applied Mathematics · doi:10.1016/0166-218x(95)00088-9 · Cited by 10
A sequential dual simplex algorithm for the linear assignment problem
Akgül, M. (1988) · Operations Research Letters · doi:10.1016/0167-6377(88)90082-x · Cited by 10
Fibonacci Heaps RevisitedPreprint
Kaplan, H. Y., Tarjan, R. E., & Zwick, U. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.5750 · Cited by 10
Self-citationEfficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem
Gualà, L., & Proietti, G. (2005) · Lecture notes in computer science · doi:10.1007/11549468_103 · Cited by 10
Algorithms for Restoration Planning in a Telecommunications Network
Cwilich, S., Deng, M., Lynch, D. F., Phillipsy, S. J., & Westbrooky, J. R. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48518-x_12 · Cited by 10
Simple method for enhancing the performance of lossy plus lossless image compression schemes
Memon, N. D., Sayood, K., & Magliveras, S. S. (1993) · Journal of Electronic Imaging · doi:10.1117/12.148253 · Cited by 10
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
Cabello, S., & Mohar, B. (2005) · Lecture notes in computer science · doi:10.1007/11561071_14 · Cited by 10
Parallel Algorithms for Butterfly ComputationsPreprint
Shi, J., & Shun, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.08607 · Cited by 10
External memory algorithms for state space exploration in model checking and action planning
Jabbar, S. (2009) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-621 · Cited by 10
Formal verification of on-chip communication fabrics
Verbeek, F. (2013) · Radboud Repository (Radboud University) · Cited by 10
Aldhafferi, N. (2025) · Computers · doi:10.3390/computers14120545 · Cited by 9
Kuo, C.-T., Xu, D., & Friesen, R. (2025) · Universe · doi:10.3390/universe11120412 · Cited by 9
Tradeoffs between safety and time: A routing view
Carmody, D., & Sowers, R. B. (2019) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2019.09.020 · Cited by 9
On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer
Stefano, G. D., Petricola, A., & Zaroliagis, C. (2006) · Lecture notes in computer science · doi:10.1007/11946441_40 · Cited by 9
On transmission time through k minimal paths of a capacitated-flow network
Lin, Y. (2009) · Applied Mathematical Modelling · doi:10.1016/j.apm.2009.04.002 · Cited by 9
Association-based similarity testing and its applications
Li, T., Ogihara, M., & Shenghuo Zhu, B. (2003) · Intelligent Data Analysis · doi:10.3233/ida-2003-7304 · Cited by 9
Max-Balanced Hungarian Scalings
Hook, J., Pestana, J., Françoise Tisseur, B., & Hogg, J. D. (2019) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/15m1024871 · Cited by 9
Incremental Construction of Low-Dimensional Data Representations
Kuleshov, A., & Bernstein, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46182-3_5 · Cited by 9
Establishing an Evacuation Network: A Path Ranking Approach
Alaeddine, H., Serrhini, K., Maïzia, M., & N�ron, E. (2019) · Journal of Computer Science · doi:10.3844/jcssp.2019.1710.1720 · Cited by 9
General Cops and Robbers games with randomness
Simard, F., Desharnais, J., & Laviolette, F. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.06.043 · Cited by 9
Efficient Parallel Shortest Path Algorithms
Alves, D. R., Krishnakumar, M. S., & Garg, V. K. (2020) · International Symposium on Parallel and Distributed Computing · doi:10.1109/ispdc51135.2020.00034 · Cited by 9
Fast computation of exact solutions of generic and degenerate assignment problems
Koehl, P., & Orland, H. (2021) · Physical review. E · doi:10.1103/physreve.103.042101 · Cited by 9
Model for determining optimal routes in complex transport systems
Terentyev, A. V., Karelina, M. Y., Егоров, В. В., Andreev, A., & Kashyzadeh, K. R. (2021) · Transportation research procedia · doi:10.1016/j.trpro.2021.09.100 · Cited by 9
Nalbantoğlu, Ö. U. (2013) · Methods in molecular biology · doi:10.1007/978-1-62703-646-7_1 · Cited by 9
Efficiently Computing Directed Minimum Spanning Trees
Böther, M., Kißig, O., & Weyand, C. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977561.ch8 · Cited by 9
Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
Mao, X. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649695 · Cited by 9
Active Learning of Domain-Specific Distances for Link Discovery
Soru, T., & Ngomo, A.-C. N. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37996-3_7 · Cited by 9
Worst-Case Optimal Priority Queues via Extended Regular Counters
Elmasry, A., & Katajainen, J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30642-6_13 · Cited by 9
Osiakwan, C. N. K., & Akl, S. G. (2002) · International Conference on Databases, Parallel Architectures, and Their Applications (PARBASE) · doi:10.1109/parbse.1990.77154 · Cited by 9
Kaplan, H. Y., Tarjan, R. E., & Zwick, U. (2013) · SIAM Journal on Computing · doi:10.1137/120880185 · Cited by 9
Self-citationKong, Z., & Mettler, B. (2010) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-010-9485-9 · Cited by 9
A new public transportation data model and shortest-path algorithms
Wang, H., Hu, M., & Xiao, W. (2010) · International Asia Conference on Informatics in Control, Automation and Robotics · doi:10.1109/car.2010.5456797 · Cited by 9
Path selection algorithms for fault tolerance in wireless mesh networks
Papapostolou, A., Friderikos, V., Ali‐Yahiya, T., & Chaouchi, H. (2011) · Telecommunication Systems · doi:10.1007/s11235-011-9497-1 · Cited by 9
An efficient algorithm for approximate betweenness centrality computation
Chehreghani, M. H. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2507826 · Cited by 9
Finding a smallest odd hole in a claw-free graph using global structure
Kennedy, W. S., & King, A. D. (2013) · Discrete Applied Mathematics · doi:10.1016/j.dam.2013.04.026 · Cited by 9
On a dual network exterior point simplex type algorithm and its computational behavior
Geranis, G., Paparrizos, K., & Angelo Sifaleras, A. (2012) · RAIRO - Operations Research · doi:10.1051/ro/2012015 · Cited by 9
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
Schliep, A., & Krause, R. (2008) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2008.50 · Cited by 9
Gansner, E. R., Hu, Y., & Kobourov, S. (2013) · Springer eBooks · doi:10.1007/978-1-4614-7485-2_3 · Cited by 9
Chapter 7 A survey of computational geometry
Mitchell, J. S. B., & Suri, S. (1995) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(05)80124-0 · Cited by 9
A survey of the all-pairs shortest paths problem and its variants in graphs
Reddy, K. R. U. K. (2016) · Acta Universitatis Sapientiae Informatica · doi:10.1515/ausi-2016-0002 · Cited by 9
Efficient Geo-Computational Algorithms for Constructing Space-Time Prisms in Road Networks
Chen, H., Chen, B. Y., Wang, Y., & Li, Q. (2016) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi5110214 · Cited by 9
Comparing Two Clusterings Using Matchings between Clusters of Clusters
Cazals, F., Mazauric, D., Tetley, R., & Watrigant, R. (2019) · ACM Journal of Experimental Algorithmics · doi:10.1145/3345951 · Cited by 9
A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression
Karpov, N., Malikić, S., Rahman, M. K., & Şahinalp, S. C. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.wabi.2018.22 · Cited by 9
An Efficient Algorithm for the Fast Delivery Problem
de Carvalho, I. A., Erlebach, T., & Papadopoulos, K. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-25027-0_12 · Cited by 9
Multilevel Artificial Neural Network Training for Spatially Correlated Learning
Scott, C. B., & Mjolsness, E. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m1191506 · Cited by 9
Enumeration Algorithms for Conjunctive Queries with Projection
Deep, S., Hu, X., & Koutris, P. (2025) · Logical Methods in Computer Science · doi:10.46298/lmcs-21(3:27)2025 · Cited by 9
The single train shortest route problem in a railyard
Aliakbari, M., Geunes, J., & Sullivan, K. M. (2021) · Optimization Letters · doi:10.1007/s11590-021-01761-w · Cited by 9
Network Tomography: A novel algorithm for probing path selection
Pepe, T., & Puleri, M. (2015) · International Conference on Communications · doi:10.1109/icc.2015.7249172 · Cited by 9
Ebendt, R., Sohr, A., Tcheumadjeu, L. C. T., & Wagner, P. (2010) · elib (German Aerospace Center) · Cited by 9
A Generic Approach to Critical Infrastructure Modeling and Simulation
Rybnicek, M., Poisel, R., Ruzicka, M., & Tjoa, S. (2012) · doi:10.1109/cybersecurity.2012.25 · Cited by 9
Vaidyanathan, B. (2013) · Networks · doi:10.1002/net.21507 · Cited by 9
Mendelson, R., Tarjan, R. E., Thorup, M., & Zwick, U. (2006) · ACM Transactions on Algorithms · doi:10.1145/1198513.1198517 · Cited by 9
Self-citationMaximizing number of satisfiable routing requests in static ad hoc networks
Sumpter, Z., Burson, L., Tang, B., & Chen, X. (2013) · Globecom · doi:10.1109/glocom.2013.6831041 · Cited by 9
Routing policy of stochastic-flow networks under time threshold and budget constraint
Lin, Y. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.07.080 · Cited by 9
Simpler Computation of Single-Source Shortest Paths in Linear Average Time
Hagerup, T. (2005) · Theory of Computing Systems · doi:10.1007/s00224-005-1260-0 · Cited by 9
Graph theory approach for match reduction in image mosaicing
Elibol, A., Gracias, N., García, R., & Kim, J. (2014) · Journal of the Optical Society of America A · doi:10.1364/josaa.31.000773 · Cited by 9
Max-Density Revisited: a Generalization and a More Efficient Algorithm
Georgakopoulos, G., & Politopoulos, K. (2007) · The Computer Journal · doi:10.1093/comjnl/bxl082 · Cited by 9
Hellmuth, M., Leydold, J., & Stadler, P. F. (2013) · Ars Mathematica Contemporanea · doi:10.26493/1855-3974.226.0a2 · Cited by 9
Approximate Shortest Path Queries in Graphs Using Voronoi Duals
Honiden, S., Houle, M. E., Sommer, C., & Wolff, M. (2009) · International Symposium on Voronoi Diagrams in Science and Engineering · doi:10.1109/isvd.2009.30 · Cited by 9
Region-Based Geospatial Abduction with Counter-IED Applications
Shakarian, P., & Subrahmanian, V. S. (2011) · Lecture notes in social networks · doi:10.1007/978-3-7091-0388-3_7 · Cited by 9
Advances in Multi-Channel Resource Allocation: Throughput, Delay, and Complexity
Ji, B., Lin, X., & Shroff, N. B. (2016) · Synthesis lectures on communication networks · doi:10.2200/s00739ed1v01y201610cnt017 · Cited by 9
Targeted optimal-path problem for electric vehicles with connected charging stations
Fu, F., & Dong, H. (2019) · PLoS ONE · doi:10.1371/journal.pone.0220361 · Cited by 9
Elmasry, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27810-8_19 · Cited by 9
Two Skew-Binary Numeral Systems and One Application
Elmasry, A., Jensen, C., & Katajainen, J. (2011) · Theory of Computing Systems · doi:10.1007/s00224-011-9357-0 · Cited by 9
So, K. (2008) · ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) · doi:10.1145/1344671.1344677 · Cited by 9
Faster shortest paths in dense distance graphs, with applications
Mozes, S., Nussbaum, Y., & Weimann, O. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.10.034 · Cited by 9
Masoudi, N., Fadel, G., & Wiecek, M. M. (2019) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4043566 · Cited by 9
Slime mould foraging: an inspiration for algorithmic design
McGarraghy, S., & Brabazon, A. (2020) · International Journal of Innovative Computing and Applications · doi:10.1504/ijica.2020.10027032 · Cited by 9
Khuller, S., & Raghavachari, B. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888239-c7 · Cited by 9
Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
Pinto, Y., & Ron Shamir, A. (1994) · Algorithmica · doi:10.1007/bf01240736 · Cited by 9
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
Gfeller, B. (2010) · Algorithmica · doi:10.1007/s00453-010-9448-3 · Cited by 9
Time and space efficient algorithms for shortest paths between convex polygons
Rohnert, H. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90022-1 · Cited by 9
Solving shortest paths efficiently on nearly acyclic directed graphs
Saunders, S., & Takaoka, T. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.10.008 · Cited by 9
On the point-to-point connection problem
Natu, M., & Fang, S. (1995) · Information Processing Letters · doi:10.1016/0020-0190(94)00216-l · Cited by 9
Recognizing shortest-path trees in linear time
Peng, C.-H., Wang, J. S., & Lee, R. C. T. (1994) · Information Processing Letters · doi:10.1016/0020-0190(94)00126-x · Cited by 9
Papadimitriou, C. H. (1986) · Lecture notes in computer science · doi:10.1007/3-540-17179-7_9 · Cited by 9
Minimum weight euclidean matching and weighted relative neighborhood graphs
Mirzaian, A. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57155-8_275 · Cited by 9
Ding, L., Shao, Y., & Li, M. (2008) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2008.405 · Cited by 9
A pointer-free data structure for merging heaps and min-max heaps
Gambosi, G., Nardelli, E., & Talamo, M. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90262-z · Cited by 9
Approximate Shortest Paths in Anisotropic Regions
Cheng, S.-W., Na, H.-S., Vigneron, A., & Wang, Y. (2007) · Scholarworks@UNIST (Ulsan National Institute of Science and Technology) · Cited by 9
A Generalization of Janson inequalities and its application to finding shortest paths
Subramanian, C. R. (1999) · Max Planck Institute for Plasma Physics · Cited by 9
Graphs for Metric Space Searching
Paredes, R. (2008) · Cited by 9
Lewandowski, S. (2010) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-2678 · Cited by 9
A Survey of Earliest Arrival Flows and a Study of the Series-Parallel Case
Steiner, M. (2009) · Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology) · Cited by 9
The Role of Vertex Consistency in Sampling-based Algorithms for Optimal Motion PlanningPreprint
Arslan, O., & Tsiotras, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.6453 · Cited by 9
Connecting Seed Lists of Mammalian Proteins Using Steiner TreesPreprint
White, A., & Ma’ayan, A. (2007) · Nature Precedings · doi:10.1038/npre.2008.1768.1 · Cited by 9
A neighborhood-preserving translation operator on graphsPreprint
Pasdeloup, B., Gripon, V., Vialatte, J.-C., Grelier, N., & Pastor, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.03859 · Cited by 9
Bounded Dijkstra (BD): Search Space Reduction for Expediting Shortest Path SubroutinesPreprint
Bemten, A. V., Guck, J. W., Machuca, C. M., & Kellerer, W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.00436 · Cited by 9
A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected GraphsPreprint
Qureshi, M. A., Hassan, F. B., Safdar, S., & Akbar, R. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0911.0174 · Cited by 9
On the Computation of Fully Proportional RepresentationPreprint
Betzler, N., Slinko, A. M., & Uhlmann, J. (2011) · SSRN Electronic Journal · doi:10.2139/ssrn.1952497 · Cited by 9
Towards combinatorial clustering: preliminary research surveyPreprint
Levin, M. S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.07872 · Cited by 9
A Local Search Algorithm for Large Maximum Weight Independent Set ProblemsPreprint
Dong, Y., Goldberg, A. V., Noe, A., Parotsidis, N., Resende, M. G. C., & Spaen, Q. (2022) · arXiv (Cornell University) · doi:10.4230/lipics.esa.2022.45 · Cited by 9
Simplexwise Distance Distributions for finite spaces with metrics and measuresPreprint
Kurlin, V. A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2303.14161 · Cited by 9
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.