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 501–600 of 3,140
A Moving Target Defense Approach to Disrupting Stealthy Botnets
Venkatesan, S., Albanese, M., Cybenko, G. V., & Jajodia, S. (2016) · ACM Workshop on Moving Target Defense (MTD) · doi:10.1145/2995272.2995280 · Cited by 48
Dijkstra's algorithm with Fibonacci heaps: an executable description in CHR
Sneyers, J., Schrijvers, T., & Demoen, B. (2005) · Lirias · Cited by 48
He, X., Li, L., Mo, Y., Sun, Z., & Qin, S. (2024) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2024.103859 · Cited by 47
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
Han, Y., & Takaoka, T. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31155-0_12 · Cited by 47
Complexity of Shift Bribery in Committee Elections
Bredereck, R., Faliszewski, P., Niedermeier, R., & Talmon, N. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10132 · Cited by 47
Bounds on the quality of approximate solutions to the group Steiner problem
Ihler, E. (1991) · Lecture notes in computer science · doi:10.1007/3-540-53832-1_36 · Cited by 47
Fast Algorithms for Weighted Bipartite Matching
Schwartz, J., Steger, A., & Weißl, A. (2005) · Lecture notes in computer science · doi:10.1007/11427186_41 · Cited by 47
The point-to-point delivery and connection problems: complexity and algorithms
Li, C., McCormick, S. T., & Simchi‐Levi, D. (1992) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)90258-c · Cited by 47
An Efficient Algorithm for Approximate Betweenness Centrality Computation
Chehreghani, M. H. (2014) · The Computer Journal · doi:10.1093/comjnl/bxu003 · Cited by 46
The Shortest-Path Problem: Analysis and Comparison of Methods
Ortega‐Arranz, H., Llanos, D. R., & González-Escribano, A. (2014) · Synthesis lectures on theoretical computer science · doi:10.2200/s00618ed1v01y201412tcs001 · Cited by 46
Macroscopic data structure analysis and optimization
Adve, V., & Lattner, C. (2005) · Cited by 46
Kolmogorov, V., Pock, T., & Rolínek, M. (2016) · SIAM Journal on Imaging Sciences · doi:10.1137/15m1010257 · Cited by 46
A fast algorithm for computing minimum routing cost spanning trees
Campos, R., & Ricardo, M. (2008) · Computer Networks · doi:10.1016/j.comnet.2008.08.013 · Cited by 46
End-to-end data paths: quickest or most reliable?
Xue, G. (1998) · IEEE Communications Letters · doi:10.1109/4234.681357 · Cited by 46
Complexity of the Minimum Base Game on Matroids
Nagamochi, H., Zeng, D., Kabutoya, N., & Ibaraki, T. (1997) · Mathematics of Operations Research · doi:10.1287/moor.22.1.146 · Cited by 46
S ilk M oth: an efficient method for finding related sets with maximum matching constraints
Deng, D., Kim, A., Madden, S. R., & Stonebraker, M. R. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3115404.3115413 · Cited by 46
I/O-Efficient Undirected Shortest Paths
Meyer, U., & Zeh, N. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39658-1_40 · Cited by 46
Finite-State Canonicalization Techniques for Historical German
Jurish, B. (2011) · Cited by 46
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Hougardy, S., Silvanus, J., & Vygen, J. (2016) · Mathematical Programming Computation · doi:10.1007/s12532-016-0110-1 · Cited by 45
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly
Rizzi, R., Tomescu, A. I., & Mäkinen, V. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-s9-s5 · Cited by 45
An Energy-Efficient Target-Tracking Strategy for Mobile Sensor Networks
Mahboubi, H., Masoudimansour, W., Aghdam, A. G., & Sayrafian, K. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2519939 · Cited by 45
Brodal, G. S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40273-9_11 · Cited by 45
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
Hassan, M. S., Aref, W. G., & Aly, A. M. (2016) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2882903.2882933 · Cited by 45
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
Chen, D. Z., Klenk, K. S., & Tu, H.-Y. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539796307194 · Cited by 45
Meldable heaps and boolean union-find
Kaplan, H. Y., Shafrir, N., & Tarjan, R. E. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.509990 · Cited by 45
Self-citationAnalysis of linear structured systems using a primal-dual algorithm
Hovelaque, V., Commault, C., & Dion, J. (1996) · Systems & Control Letters · doi:10.1016/0167-6911(95)00039-9 · Cited by 45
A unicast-based approach for streaming multicast
Cohen, R., & Kaempfer, G. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916727 · Cited by 45
Graph Transformation Method for Calculating Waiting Times in Markov ChainsPreprint
Trygubenko, S. A., & Wales, D. J. (n.d.) · Cited by 45
King, D. J. (1995) · Workshops in computing · doi:10.1007/978-1-4471-3573-9_10 · Cited by 44
Cross-Layer Aided Energy-Efficient Routing Design for Ad Hoc Networks
Zuo, J., Dong, C., Ng, S. X., Yang, L., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2395378 · Cited by 44
Complexity analysis of energy-efficient single machine scheduling problems
Aghelinejad, M. M., Ouazène, Y., & Yalaoui, A. (2019) · Operations Research Perspectives · doi:10.1016/j.orp.2019.100105 · Cited by 44
Agile autonomous guidance using spatial value functions
Mettler, B., Dadkhah, N., & Kong, Z. (2010) · Control Engineering Practice · doi:10.1016/j.conengprac.2010.02.013 · Cited by 44
Shortest paths in traffic-light networks
Chen, Y., & Yang, H.-H. (2000) · Transportation Research Part B Methodological · doi:10.1016/s0191-2615(99)00023-5 · Cited by 44
Khuller, S., & Raghavachari, B. (1996) · Chapman & Hall/CRC eBooks · doi:10.1201/9780429171529-5 · Cited by 44
Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets
Goldberg, A. V., & Silverstein, C. D. (1997) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-59179-2_15 · Cited by 44
The Scaling Network Simplex Algorithm
Ahuja, R. K., & Orlin, J. B. (1992) · Operations Research · doi:10.1287/opre.40.1.s5 · Cited by 44
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
Li, Y., Thai, M. T., Wang, F., & Du, D. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.154 · Cited by 43
Risk-Aware Provisioning for Optical WDM Mesh Networks
Xia, M., Tornatore, M., Martel, C. U., & Mukherjee, B. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2095037 · Cited by 43
HLDB: location-based services in databases
Abraham, I., Delling, D., Fiat, A., Goldberg, A. V., & Werneck, R. F. (2012) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/2424321.2424365 · Cited by 43
Sequential image segmentation based on minimum spanning tree representation
Sağlam, A., & Baykan, N. A. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2016.06.001 · Cited by 43
Algorithms for the Simple Equal Flow Problem
Ahuja, R. K., Orlin, J. B., Sechi, G. M., & Zuddas, P. (1999) · Management Science · doi:10.1287/mnsc.45.10.1440 · Cited by 43
Takaoka, T. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(02)00219-6 · Cited by 43
Incremental algorithms for minimal length paths
Ausiello, G., Italiano, G. F., Marchetti-Spaccamela, A., & Nanni, U. (1990) · Symposium on Discrete Algorithms · doi:10.5555/320176.320178 · Cited by 43
Combining Speed-Up Techniques for Shortest-Path Computations
Holzer, M., Schulz, F., & Willhalm, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24838-5_20 · Cited by 43
Path planning in the presence of vertical obstacles
Gewali, L. P., Ntafos, S. C., & Tollis, I. G. (1990) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.56665 · Cited by 43
Deleting a marked state in quantum database in a duality computing mode
Liu, Y. (2013) · Chinese Science Bulletin · doi:10.1007/s11434-013-5925-9 · Cited by 42
Incremental Multi-Scale Search Algorithm for Dynamic Path Planning With Low Worst-Case Complexity
Lu, Y., Huo, X., Arslan, O., & Tsiotras, P. (2011) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2157493 · Cited by 42
GRAPE: parallelizing sequential graph computations
Fan, W., Xu, J., Wu, Y., Yu, W., & Jiang, J. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137765.3137801 · Cited by 42
How to Securely Outsource Finding the Min-Cut of Undirected Edge-Weighted Graphs
Zhao, P., Yu, J., Zhang, H., Qin, Z., & Wang, C. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2922277 · Cited by 42
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
Olver, N., & Végh, L. A. (2020) · Journal of the ACM · doi:10.1145/3383454 · Cited by 42
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors
Nepomniaschaya, A., & Dvoskina, M. A. (2000) · Fundamenta Informaticae · doi:10.3233/fi-2000-43123412 · Cited by 42
Practical Issues and Algorithms for Analyzing Terrorist Networks 1
Carpenter, T., Karakostas, G., & Shallcross, D. (2002) · Cited by 42
Anytime QoS optimization over the PlanGraph for web service composition
Yan, Y., Chen, M., & Yang, Y.-B. (2012) · ACM Symposium on Applied Computing · doi:10.1145/2245276.2232101 · Cited by 42
All-pairs shortest paths and the essential subgraph
McGeoch, C. C. (1995) · Algorithmica · doi:10.1007/bf01190847 · Cited by 42
A polynomial dual simplex algorithm for the generalized circulation problem
Goldfarb, D., Jin, Z., & Lin, Y. (2002) · Mathematical Programming · doi:10.1007/s101070100248 · Cited by 41
FuzzyMatte: A computationally efficient scheme for interactive matting
Zheng, Y., Kambhamettu, C., Jingyi Yu, A., BAUER, T. L., & Steiner, K. V. (2008) · 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.2008.4587455 · Cited by 41
Finding the first K shortest paths in a time-window network
Chen, Y., & Yang, H. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00230-7 · Cited by 41
An algorithm for fractional assignment problems
Shigeno, M., Saruwatari, Y., & Matsui, T. (1995) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)00094-g · Cited by 41
A capacity scaling algorithm for the constrained maximum flow problem
Ahuja, R. K., & Orlin, J. B. (1995) · Networks · doi:10.1002/net.3230250207 · Cited by 41
Scheduling algorithms for multi-hop radio networks
Ramanathan, S., & Lloyd, E. L. (1992) · ACM SIGCOMM Computer Communication Review · doi:10.1145/144191.144283 · Cited by 41
Efficient dual simplex algorithms for the assignment problem
Goldfarb, D. (1986) · Mathematical Programming · doi:10.1007/bf01582238 · Cited by 41
Efficient solutions to multicast routing in communication networks
Makki, K., Pissinou, N., & Frieder, O. (1996) · Mobile Networks and Applications · doi:10.1007/bf01193338 · Cited by 41
Solving Jigsaw Puzzles by the Graph Connection Laplacian
Huroyan, V., Lerman, G., & Wu, H. (2020) · SIAM Journal on Imaging Sciences · doi:10.1137/19m1290760 · Cited by 40
Localized Topological Simplification of Scalar Data
Lukasczyk, J., Garth, C., Maciejewski, R., & Tierny, J. (2020) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2020.3030353 · Cited by 40
An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph
Banerjee, S. (1991) · Pattern Recognition Letters · doi:10.1016/0167-8655(91)90316-e · Cited by 40
Tazari, S., & Müller‐Hannemann, M. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2008.08.002 · Cited by 40
An Efficient Approach to Updating Closeness Centrality and Average Path Length in Dynamic Networks
Yen, C.-C., Yeh, M.-Y., & Chen⋆, M.-S. (2013) · Proceedings · doi:10.1109/icdm.2013.135 · Cited by 40
Gutenschwager, K., Völker, S., Radtke, A., & Zeller, G. (2012) · Winter Simulation Conference · doi:10.1109/wsc.2012.6465023 · Cited by 40
Developing algorithms and software for geometric path planning problems
Chen, D. Z. (1996) · ACM Computing Surveys · doi:10.1145/242224.242246 · Cited by 40
BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a Chip
Körte, B., Rautenbach, D., & Vygen, J. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.889373 · Cited by 40
Katriel, I., & Bodlaender, H. L. (2006) · ACM Transactions on Algorithms · doi:10.1145/1159892.1159896 · Cited by 40
On the k-layer planar subset and topological via minimization problems
Cong, J., & Liu, C. L. (1991) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.85735 · Cited by 40
Automated assignment of backbone NMR peaks using constrained bipartite matching
Xu, Y., Xu, D. H., Kai, D., Olman, V. N., Razumovskaya, J., & Jiang, T. (2002) · Computing in Science & Engineering · doi:10.1109/5992.976437 · Cited by 40
Efficient structural graph clustering: an index-based approach
Wen, D., Qin, L., Zhang, Y., Chang, L., & Lin, X. (2019) · The VLDB Journal · doi:10.1007/s00778-019-00541-4 · Cited by 39
E2E: embracing user heterogeneity to improve quality of experience on the web
Zhang, X., Sen, S., Kurniawan, D. H., Gunawi, H. S., & Jiang, J. (2019) · ACM Special Interest Group on Data Communication · doi:10.1145/3341302.3342089 · Cited by 39
Widdowson, D., & Kurlin, V. A. (2023) · 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/cvpr52729.2023.00129 · Cited by 39
Intra graph clustering using collaborative similarity measure
Nawaz, W., Khan, K.-U., Lee, Y.-K., & Lee, S. (2015) · Distributed and Parallel Databases · doi:10.1007/s10619-014-7170-x · Cited by 39
The saga of minimum spanning trees
Mareš, M. (2008) · Computer Science Review · doi:10.1016/j.cosrev.2008.10.002 · Cited by 39
Theory and Practice in Large Carpooling Problems
Hartman, I. B., Keren, D., Dbai, A. A., Cohen, E., Knapen, L., Yasar, A.-U.-H., & Janssens, D. (2014) · Procedia Computer Science · doi:10.1016/j.procs.2014.05.433 · Cited by 39
Bernstein, A. (2010) · Symposium on Discrete Algorithms · doi:10.5555/1873601.1873662 · Cited by 39
An efficient shortest path approach for social networks based on community structure
Gong, M., Li, G., Wang, Z., Ma, L., & Tian, D. (2016) · CAAI Transactions on Intelligence Technology · doi:10.1016/j.trit.2016.03.011 · Cited by 39
Faster Worst Case Deterministic Dynamic Connectivity
Kejlberg-Rasmussen, C., Kopelowitz, T., Pettie, S., & Thorup, M. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2016.53 · Cited by 39
Kao, M., Lam, T., Sung, W.-K. K., & Ting, H. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48481-7_38 · Cited by 39
Level graphs and approximate shortest path algorithms
Shapiro, J., Waxman, J., & Nir, D. (1992) · Networks · doi:10.1002/net.3230220707 · Cited by 39
Experimental Evaluation of a New Shortest Path Algorithm
Pettie, S., Ramachandran, V., & Sridhar, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45643-0_10 · Cited by 39
Hierarchical Agglomerative Graph Clustering in Nearly-Linear TimePreprint
Dhulipala, L., Eisenstat, D., Łącki, J., Mirrokni, V., & Shi, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.05610 · Cited by 39
A Linear Potential Function for Pairing Heaps
Iacono, J., & Yagnatinsky, M. V. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-48749-6_36 · Cited by 38
Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
Zheng, Y., Lu, R., Li, B., Shao, J., Yang, H., & Choo, K. R. (2019) · Information Sciences · doi:10.1016/j.ins.2019.05.055 · Cited by 38
Nuanmeesri, S. (2019) · Applied Computing and Informatics · doi:10.1016/j.aci.2019.11.001 · Cited by 38
Efficient construction of directed hopsets and parallel approximate shortest paths
Cao, N., Fineman, J. T., & Russell, K. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384270 · Cited by 38
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs
Matsui, T. (1997) · Algorithmica · doi:10.1007/pl00009171 · Cited by 38
Dynamic algorithms for shortest paths in planar graphs
Feuerstein, E., & Marchetti-Spaccamela, A. (1993) · Theoretical Computer Science · doi:10.1016/0304-3975(93)90328-q · Cited by 38
Rectilinear Path Problems among Rectilinear Obstacles Revisited
Yang, C. D., Lee, D. T., & Wong, C. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792229672 · Cited by 38
A genuinely polynomial primal simplex algorithm for the assignment problem
Akgül, M. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90054-r · Cited by 38
Compiler optimization on instruction scheduling for low power
Lee, C., Lee, J. K., & Hwang, T. (2002) · International Symposium on System Synthesis (ISSS) · doi:10.1109/isss.2000.874029 · Cited by 38
Symbolic finite differencing - Part I
Paige, R. A. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52592-0_54 · Cited by 38
Shortest path algorithms: A computational study with the C programming language
Mondou, J.-F., Crainic, T. G., & Nguyen, S. (1991) · Computers & Operations Research · doi:10.1016/0305-0548(91)90014-i · Cited by 38
Timetable information and shortest paths
Schulz, F. (2005) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000002042 · Cited by 38
Applications of shortest path methods
Pina, J. C. (1995) · Data Archiving and Networked Services (DANS) · Cited by 38
Macroscopic Data Structure Analysis and Optimization
Lattner, C. (2005) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 38
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.