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,901–2,000 of 3,140
MLSA: A link-state multipath routing algorithm
Geng, H., Yin, X., Shi, X., & Wang, Z. (2013) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2013.6754968 · Cited by 3
Computation of the optimal value function in time‐dependent networks
Kluge, S., Reif, K., & Brokate, M. (2013) · Networks · doi:10.1002/net.21501 · Cited by 3
Algorithm Design and Analysis Techniques
Reingold, E. M. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888239-c1 · Cited by 3
Algorithms for shortest paths and d-cycle problems
Bespamyatnikh, S. N., & Kelarev, A. V. (2003) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00002-9 · Cited by 3
Group recommendation in online learning environment using community detection
Kumaran, V. S., Sankar, A., & Kiruthikaa, K. (2015) · International Journal of Computational Systems Engineering · doi:10.1504/ijcsyse.2015.067800 · Cited by 3
Knowledge Management and Routing in embodied agents networks
Moriconi, C., & Snels, C. (2013) · IFAC Proceedings Volumes · doi:10.3182/20131111-3-kr-2043.00012 · Cited by 3
Evaluation Framework for Video OCR
Soundararajan, P., Boonstra, M., Manohar, V., Korzhova, V. N., Goldgof, D. B., Kasturi, R., Prasad, S., Raju, H., Bowers, R., & Garofolo, J. S. (2006) · Lecture notes in computer science · doi:10.1007/11949619_74 · Cited by 3
Evaluation of Spatial Keyword Queries with Partial Result Support on Spatial Networks
Zhang, J., Ku, W., Jiang, X., Qin, X., & Hsueh, Y.-L. (2013) · IEEE International Conference on Mobile Data Management (MDM) · doi:10.1109/mdm.2013.41 · Cited by 3
New complexity results for time-constrained dynamical optimal path problems
Kluge, S., Brokate, M., & Reif, K. (2010) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00201 · Cited by 3
Tilewise Accumulated Cost Surface Computation with Graphics Processing Units
Kovanen, J., & Sarjakoski, T. (2015) · ACM Transactions on Spatial Algorithms and Systems · doi:10.1145/2803172 · Cited by 3
Exact and Heuristic Algorithms for Risk‐Aware Stochastic Physical Search
Brown, D. S., Hudack, J., Gemelli, N., & Banerjee, B. (2016) · Computational Intelligence · doi:10.1111/coin.12098 · Cited by 3
Harmony and Voicing Interpolation for Automatic Music Composition Assistance
Wilk, C. M., & Sagayama, S. (2018) · Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC) · doi:10.23919/apsipa.2018.8659617 · Cited by 3
Simple and fast trip generation for large scale traffic simulation
Imamichi, T., & Raymond, R. (2013) · Winter Simulation Conference · doi:10.1109/wsc.2013.6721580 · Cited by 3
Efficient Algorithm for Constructing Order K Voronoi Diagrams in Road Networks
Chen, B. Y., Huang, H., Chen, H., Liu, W., Chen, X.-Y., & Jia, T. (2023) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi12040172 · Cited by 3
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
Kopelowitz, T., Korin, A., & Roditty, L. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2024.101 · Cited by 3
Minimum-cost paths for electric cars
Dorfman, D., Kaplan, H. Y., Tarjan, R. E., Thorup, M., & Zwick, U. (2024) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977936.34 · Cited by 3
Self-citationFairness-Aware Dense Subgraph Discovery
Kariotakis, E., Sidiropoulos, N. D., & Konar, A. (2025) · Lirias · Cited by 3
SPSC: Efficient Composition of Semantic Services in Unstructured P2P Networks
Cao, X., Kapahnke, P., & Klusch, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-18818-8_28 · Cited by 3
K-th shortest collision-free path planning
Lirov, Y. (1988) · Applied Mathematics Letters · doi:10.1016/0893-9659(88)90177-2 · Cited by 3
AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS
Khachaturov, G. (2002) · Cybernetics & Systems · doi:10.1080/019697202753306497 · Cited by 3
Multipath Routing Algorithm Applied to Cloud Data Center Services
Matsuura, H. (2012) · IEICE Transactions on Communications · doi:10.1587/transcom.e95.b.2558 · Cited by 3
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
Babenko, M. A. (2009) · Algorithmica · doi:10.1007/s00453-009-9377-1 · Cited by 3
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem
Williamson, M. D., Eirinakis, P., & Subramani, K. (2014) · Algorithmica · doi:10.1007/s00453-014-9945-x · Cited by 3
Non-iterative algorithm for finding shortest route
Maposa, D., Mupondo, N. C., & Trust Tawanda (2014) · International Journal of Logistics Economics and Globalisation · doi:10.1504/ijleg.2014.064294 · Cited by 3
Evaluation of network reliability for a computer network subject to a budget constraint
Lin, Y. (2012) · International journal of innovative computing, information & control · Cited by 3
A Forward-Backward Single-Source Shortest Paths Algorithm
Wilson, D. B., & Zwick, U. (2015) · SIAM Journal on Computing · doi:10.1137/140970975 · Cited by 3
Cascade Heap: Towards Time-Optimal Extractions
Babenko, M. A., Kolesnichenko, I., & Smirnov, I. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-58747-9_8 · Cited by 3
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms
Avraham, R. B., Henze, M., Jaume, R., Keszegh, B., Raz, O. E., Sharir, M., & Tubis, I. (2017) · Algorithmica · doi:10.1007/s00453-017-0326-0 · Cited by 3
Takazawa, K. (2022) · SIAM Journal on Discrete Mathematics · doi:10.1137/18m1176737 · Cited by 3
Riba, P., Dutta, A., Dey, S., Lladós, J., & Fornés, A. (2017) · IAPR International Conference on Document Analysis and Recognition (ICDAR) · doi:10.1109/icdar.2017.84 · Cited by 3
Think Sequential, Run Parallel
Fan, W., Liu, M., Xu, R., Hou, L., Li, D., & Meng, Z. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01461-2_1 · Cited by 3
Towards the Completion of a Domain-Specific Knowledge Base with Emerging Query Terms
Jiang, S., Liang, J., Xiao, Y., Tang, H., Huang, H., & Tan, J. Z. (2019) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2019.00129 · Cited by 3
Heuristics for the connected assignment problem in arrays
Campêlo, M. B., Soares, J. C., Maciel, T. F., & Lima, F. R. M. (2019) · International Transactions in Operational Research · doi:10.1111/itor.12706 · Cited by 3
Route assignment and scheduling with trajectory coordination
Matin-Moghaddam, N., & Sefair, J. A. (2020) · IISE Transactions · doi:10.1080/24725854.2020.1774096 · Cited by 3
Bounded Evaluation: Querying Big Data with Bounded Resources
Cao, Y., Fan, W., & Yuan, T. (2020) · Machine Intelligence Research · doi:10.1007/s11633-020-1236-1 · Cited by 3
Applications of Network Analysis in Biomedicine
Wang, S., & Huang, T. (2020) · Methods in molecular biology · doi:10.1007/978-1-0716-0904-0_4 · Cited by 3
A Weight-Scaling Algorithm for f-Factors of Multigraphs
Gabow, H. N. (2023) · Algorithmica · doi:10.1007/s00453-023-01127-x · Cited by 3
Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks
Köppl, D. (2022) · Information · doi:10.3390/info13040168 · Cited by 3
Tụy, H. (2016) · Springer optimization and its applications · doi:10.1007/978-3-319-31484-6_9 · Cited by 3
A Robust Graph Theoretic Solution of Routing in Intelligent Networks
Qureshi, M. A., Hassan, M. F., Ehsan, M. K., Khan, M. O., Ali, M. Y., & Khan, S. (2022) · Wireless Communications and Mobile Computing · doi:10.1155/2022/9661411 · Cited by 3
The FastMap Pipeline for Facility Location Problems
Thakoor, O., Li, A., Koenig, S., Ravi, S., Kline, E., & Kumar, T. K. S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-21203-1_25 · Cited by 3
Near-optimal Steiner tree computation powered by node embeddings
Yang, B., & Zheng, W. (2023) · Knowledge and Information Systems · doi:10.1007/s10115-023-01893-8 · Cited by 3
Saxena, M. C., Sabharwal, M., & Bajaj, P. R. (2023) · International Journal on Recent and Innovation Trends in Computing and Communication · doi:10.17762/ijritcc.v11i8s.7172 · Cited by 3
On Doubled and Quadrupled Fibonacci Type Sequences
Yilmaz, N. Ş., Włoch, A., Özkan, E., & Strzałka, D. (2023) · Annales Mathematicae Silesianae · doi:10.2478/amsil-2023-0020 · Cited by 3
A FastMap-Based Framework for Efficiently Computing Top-K Projected Centrality
Li, A., Stuckey, P. J., Koenig, S., & Kumar, T. K. S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-53969-5_13 · Cited by 3
Pamuk, B., Öncan, T., & Altınel, İ. K. (2025) · European Journal of Operational Research · doi:10.1016/j.ejor.2025.01.044 · Cited by 3
System Travel Time Reliability: A Measure of the Quality of Service of Networks
Jane, C., & Laih, Y. (2015) · Quality and Reliability Engineering International · doi:10.1002/qre.1792 · Cited by 3
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
Wu, B. Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17461-2_18 · Cited by 3
Weiss, A., Mahmoud, M. S., Kucirek, P., & Habib, K. N. (2014) · Canadian Journal of Civil Engineering · doi:10.1139/cjce-2014-0202 · Cited by 3
Topology control algorithm using fault-tolerant 1-spanner for wireless ad hoc networks
Sun, R., Wang, Y., Yuan, J., Shan, X., & Ren, Y. (2012) · Tsinghua Science & Technology · doi:10.1109/tst.2012.6180044 · Cited by 3
Multi-Point Shortest Path in the Complex Road Network Based on Floyd Algorithm
Li, Y., Li, D., & Yu, Y. (2013) · Communications in computer and information science · doi:10.1007/978-3-642-53703-5_38 · Cited by 3
Meldable RAM priority queues and minimum directed spanning trees
Mendelson, R., Thorup, M., & Zwick, U. (2004) · Symposium on Discrete Algorithms · doi:10.5555/982792.982798 · Cited by 3
Steiner problems on directed acyclic graphs
Hsu, T., Tsai, K.-H., Wang, D., & Lee, D. T. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61332-3_135 · Cited by 3
Structured sparse matrix-vector multiplication on massively parallel SIMD architectures
Dehn, T., Eiermann, M., Giebermann, K., & Sperling, V. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00055-0 · Cited by 3
Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
Kowalczuk, Z., & Oliński, K. (2008) · International Journal of Applied Mathematics and Computer Science · doi:10.2478/v10006-008-0049-0 · Cited by 3
An efficient route computation approach for large graphs
Song, Q., & Wang, X. (2011) · Chinese Control Conference (CCC) · Cited by 3
Shioura, A., & Suzuki, S. (2012) · Journal of the Operations Research Society of Japan · doi:10.15807/jorsj.55.92 · Cited by 3
Talvitie, T. (2015) · Työväentutkimus Vuosikirja · Cited by 3
Optimizing the Cloud Service Experience Using Constraint Programming
Kadıoğlu, S., Colena, M., Huberman, S., & Bagley, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23219-5_43 · Cited by 3
UniDegree: A GPU-Based Graph Representation for SSSP
Zhang, C., Wang, F., Huang, K., Liu, Z., & Chen, Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-27122-4_49 · Cited by 3
Performance of shortest path algorithm based on parallel vertex traversal
Vesović, M., Smiljanić, A., & Kostić, D. (2016) · Serbian Journal of Electrical Engineering · doi:10.2298/sjee1601031v · Cited by 3
Linear Algebraic Primitives for Parallel Computing on Large Graphs
Bárbara, S. (2010) · Cited by 3
Le, Y., Bax, E. T., Barbieri, N., García-Soriano, D., Mehta, J., & Li, J. (2016) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2016.7727783 · Cited by 3
Exact Dominance Querying Algorithm on CP-nets
Xin, G., & Liu, J. (2016) · International Journal of Database Theory and Application · doi:10.14257/ijdta.2016.9.5.03 · Cited by 3
Wu, B. Y., & Chao, K.-M. (2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203497289-8 · Cited by 3
Wu, B. Y., & Chao, K.-M. (2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203497289-9 · Cited by 3
Contextualization of drug-mediator relations using evidence networks
Tran, H. J., Speyer, G., Kiefer, J., & Kim, S. (2017) · BMC Bioinformatics · doi:10.1186/s12859-017-1642-8 · Cited by 3
Unambiguous switching link group failure localization in all‐optical networks
Pašíć, A., Babarczi, P., & Tapolcai, J. (2017) · Networks · doi:10.1002/net.21779 · Cited by 3
Theoretically and Empirically High Quality Estimation of Closeness Centrality
Murai, S. (2017) · Proceedings · doi:10.1109/icdm.2017.126 · Cited by 3
Sandhu, S. S., Jadhav, A. R., & Tripathy, B. K. (2017) · International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) · doi:10.1109/icrcicn.2017.8234510 · Cited by 3
Cache-Oblivious Computation: Algorithms and Experimental Evaluation
Ramachandran, V. (2007) · International Conference on Computing: Theory and Applications · doi:10.1109/iccta.2007.34 · Cited by 3
A Landmark Algorithm for the Time-Dependent Shortest Path Problem
大嶋, 達. (2008) · Cited by 3
Jungnickel, D. (2012) · Algorithms and computation in mathematics · doi:10.1007/978-3-642-32278-5_14 · Cited by 3
A GROWING FUNCTIONAL MODULE DESIGNED TO TRIGGER CAUSAL INFERENCE
Pasquier, J. L. (2007) · International Conference on Informatics in Control, Automation and Robotics (ICINCO) · doi:10.5220/0001643704560463 · Cited by 3
Efficient Algorithms for Geometric Shortest Path Query Problems
Chen, D. Z. (1998) · Springer eBooks · doi:10.1007/978-1-4613-0303-9_10 · Cited by 3
A shortest path algorithm for moving objects in spatial network databases
Yin, X., Ding, Z., & Li, J. (2008) · Progress in Natural Science Materials International · doi:10.1016/j.pnsc.2008.01.031 · Cited by 3
A Forward-Backward Single-Source Shortest Paths Algorithm
Wilson, D. B., & Zwick, U. (2013) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2013.81 · Cited by 3
Efficient Parallel Algorithms for Planar st-Graphs
Atallah, Chen, & Daescu (2003) · Algorithmica · doi:10.1007/s00453-002-0995-0 · Cited by 3
Enhancing privacy protection in fault replication systems
Matos, J., Garcia, J. C., & Romano, P. (2015) · Proceedings/Proceedings - International Symposium on Software Reliability Engineering · doi:10.1109/issre.2015.7381827 · Cited by 3
Chapter 7 Fundamental algorithms and data structures
Leeuwen, J. V., & Widmayer, P. (1992) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(05)80204-x · Cited by 3
Cabral, F. L., Osthoff, C., Ramos, D., & Nardes, R. (2015) · International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW) · doi:10.1109/sbac-padw.2015.28 · Cited by 3
Maximizing the Sum of Radii of Disjoint Balls or Disks
Eppstein, D. (2016) · Journal of computational geometry · doi:10.20382/jocg.v8i1a12 · Cited by 3
Packet Capture and Analysis on MEDINA, A Massively Distributed Network Data Caching Platform
Sapio, A., Baldi, M., Risso, F., Anand, N., & Nucci, A. (2017) · Parallel Processing Letters · doi:10.1142/s0129626417500104 · Cited by 3
Enforcing network policy in heterogeneous network function box environment
Cui, L., Tso, F. P., & Weijia Jia, B. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.03.029 · Cited by 3
Computing Weighted Strength and Applications to Partitioning
Galtier, J. (2018) · SIAM Journal on Discrete Mathematics · doi:10.1137/15m102914x · Cited by 3
Load Balanced Model for Bandwidth Calendaring Problem
Tsujino, M. (2018) · Global Information Infrastructure and Networking Symposium · doi:10.1109/giis.2018.8635765 · Cited by 3
The b -branching problem in digraphs
Kakimura, N., Kamiyama, N., & Takazawa, K. (2020) · Discrete Applied Mathematics · doi:10.1016/j.dam.2020.02.005 · Cited by 3
Computation and data transfer co-scheduling for interconnection bus minimization
Xu, C. Q., Xue, C. J., Hu, B. C., & Sha, E. H. ‐. (2009) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2009.4796499 · Cited by 3
Wu, B. Y., Guo, J.-L., & Wang, Y.-L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.5235 · Cited by 3
Constrained Shortest Paths in Terrains and Graphs
Ahmed, M. (2009) · UWSpace (University of Waterloo) · Cited by 3
Chen, D. Z., & Xu, J. (2001) · Computational Geometry · doi:10.1016/s0925-7721(01)00005-0 · Cited by 3
Algorithms and dynamics data structures for basic graph optimization problems
Pettie, S., & Duan, R. (2011) · Deep Blue (University of Michigan) · Cited by 3
Experimental evaluation of algorithmic solutions for the maximum generalised network flow problem
Radzik, T., & Yang, S. (2001) · Brunel University Research Archive (BURA) (Brunel University London) · doi:10.13140/rg.2.1.3822.4729 · Cited by 3
Hierarchische Graphen zur Wegesuche
Buchholz, F. (2000) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-2455 · Cited by 3
A design and implementation of an efficient, parallel watershed algorithm for affinity graphs
Zlateski, A. (2011) · Cited by 3
Design and Evaluation of the Hamal Parallel Computer
Grossman, J. P. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Equivalence Between Priority Queues and Sorting
Chowdhury, R. A. (2008) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_127 · Cited by 3
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
Katriel, I. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24664-0_13 · Cited by 3
Michailidis, G. C. (2005) · Wiley eBooks · doi:10.1002/0470013192.bsa391 · Cited by 3
Measuring Similarity of Graphs and their Nodes by Neighbor MatchingPreprint
Nikolić, M. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.5290 · Cited by 3
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.