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 2,501–2,600 of 3,140
Exact and Heuristic Approaches to Arc Routing Problems
Dang, T. (2022) · Lancaster EPrints (Lancaster University) · doi:10.17635/lancaster/thesis/1709 · Cited by 1
APPROXIMATION ALGORITHMS FOR MAXIMUM VERTEX-WEIGHTED MATCHING
Herz, A. I. A. (2019) · Purdue e-Pubs (Purdue University System) · doi:10.25394/pgs.11311061 · Cited by 1
Additional file 1 of An information-theoretic, all-scales approach to comparing networks
P. Bagrow, J., & M. Bollt, E. (2019) · Figshare · doi:10.6084/m9.figshare.8940716 · Cited by 1
Computing and Learning on Combinatorial Data
Zhang, S. (2025) · arXiv (Cornell University) · doi:10.25394/pgs.28234577 · Cited by 1
Lexicographic path searches for FPGA routing
So, K. (2008) · UNSWorks (UNSW Sydney) · doi:10.26190/unsworks/17923 · Cited by 1
KLSM: a relaxed lock-free priority queue
Gruber, J. (2016) · reposiTUm (TU Wien) · doi:10.34726/hss.2016.33752 · Cited by 1
New Multiobjective Shortest Path Algorithms
Maristany De Las Casas, P. (2023) · doi:10.17169/refubium-43569 · Cited by 1
Geometric Inhomogeneous Random Graphs for Algorithm Engineering
Weyand, C. (2023) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000158520 · Cited by 1
Data models, graph analysis, and information retrieval from biological data
Fechete, R. (2009) · reposiTUm (TU Wien) · Cited by 1
Efficient algorithms for the minimum cost perfect matching problem on general graphs
Atamtürk, A. (1993) · Bilkent University Institutional Repository (Bilkent University) · Cited by 1
Kuhn Andriotti, G. (2009) · Online Publication Service of Würzburg University (Würzburg University) · Cited by 1
A simple parallel algorithm for the single-source shortest path problem on planar diagraphs
Träff, J., & Zaroliagis, C. (1996) · MPG.PuRe (Max Planck Society) · Cited by 1
Gareau, J. C. (2019) · Archipel (Université du Québec à Montréal) · Cited by 1
Li, D. T. (2023) · eScholarship (California Digital Library) · Cited by 1
The origin-destination shortest path problem
(1993) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Mikheev, V. (2020) · K-State Research Exchange (Kansas State University) · Cited by 1
From Hop Reduction to Sparsification for Negative Length Shortest PathsPreprint
Quanrud, K., & Tajkhorshid, N. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2511.18253 · Cited by 1
Partition-based Simple HeapsPreprint
Brodal, G. S., Iacono, J., Rysgaard, C. M., & Wild, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.01206 · Cited by 1
Alaeddine, H. (2014) · theses.fr (ABES) · doi:10.70675/9852350fza895z4600z893ezc8c125e1591b · Cited by 1
Services de répartition de charge pour le Cloud : application au traitement de données multimédia
Lefebvre, S. (2013) · theses.fr (ABES) · doi:10.70675/91c147a5z3a99z47a1z9995zf6c3e34c50b3 · Cited by 1
Wang, Z. (2015) · theses.fr (ABES) · doi:10.70675/fb78f3dcz198dz4974zbfb6z93b496f7f8fa · Cited by 1
Efficient route planning for dynamic and multimodal transportation networks
Falek, A. M. (2020) · theses.fr (ABES) · doi:10.70675/cdcadd40z8d68z404az9dcdze37c68fab0c2 · Cited by 1
Quinton, F. (2023) · theses.fr (ABES) · doi:10.70675/757b7649z536ez4250zabd8z94bba0802674 · Cited by 1
Condette, F. (2025) · theses.fr (ABES) · doi:10.70675/c8ce063bz3d9fz457aza647zdccf5744046a · Cited by 1
A Coalgebraic Dijkstra AlgorithmPreprint
Sanada, T., Montacute, Y., Phalakarn, K., & Hasuo, I. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.22149 · Cited by 1
Heaps and Their Working SetsPreprint
Haeupler, B., Hladík, R., Rozhoň, V., & Tarjan, R. E. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.24621 · Cited by 1
Self-citationInstance-Optimality of Bidirectional Dijkstra on Simple GraphsPreprint
Bertram, C., Jensen, M. V., Thorup, M., Wang, H., & Yan, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.24380 · Cited by 1
A Long Movement Story Cut Short - On the Compression of Trajectory Data
Koegel, M. (2012) · Univ. Duesseldorf: Duesseldorfer Dokumenten- und Publikationsserver · doi:10.13140/rg.2.2.24433.56162 · Cited by 1
An Exact Bidirectional Approach to the Resource Constrained Project Scheduling Problem
Karnoub, R. E. (2002) · NCSU Libraries Repository (North Carolina State University Libraries) · Cited by 1
O problema da designação e sua variante parametrica
de Abreu, L. N. (2000) · doi:10.47749/t/unicamp.2000.189454
Point-based Geospatial Abduction
Shakarian, P., & Subrahmanian, V. S. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1794-1_2
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications
David Coudert, A. (2001) · HAL
Trees and paths: graph optimisation problems with industrial applications
Burkard, R. E. (2000) · Lecture notes in mathematics · doi:10.1007/bfb0103916
Arbres couvrants et arborescences
Körte, B., Vygen, J., Fonlupt, J., & Skoda, A. (2010) · Springer eBooks · doi:10.1007/978-2-287-99037-3_6
Συντομότερες Διαδρομές Δύο Κριτηρίων: Αλγόριθμοι και Πειραματική Αξιολόγιση
Τσαγγούρης, Γ. (2006) · Νημερτής
Noncoherent receiver designs for ultra-wideband systems
Zhou, Q. (2013) · SMARTech Repository (Georgia Institute of Technology)
Modular Structures, Robustness and Protection of Complex Networks: Theory, Complexity and Algorithms
Trajanovski, S. (2014) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:5560b786-32db-4ed1-9be8-ee8d6fc5e116
Improving vehicle routing using traffic predictions
Loof, P. C. (2014) · Research Repository (Delft University of Technology)
Williamson, M. D. (2013) · The Research Repository @ WVU (West Virginia University) · doi:10.33915/etd.312
Unit 064 - Representing Networks
GIScience, C. I., & Zhan, F. B. (2000)
Parameterized searching with mismatches for run-length encoded strings (extended abstract)
Apostolico, A., Erdős, P. L., & Jüttner, A. (2010) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)
Energy-aware Wireless Multi-hop Networks
Vazifehdan, J. (2011) · Research Repository (Delft University of Technology)
On Coordination Among Multiple Auctions
Liu, P. C., & Sun, A. W. (2007) · Springer eBooks · doi:10.1007/978-3-540-73814-5_10
Güting, R. H., & Dieker, S. (2004) · Leitfäden der Informatik · doi:10.1007/978-3-322-89113-6_5
8-heap* : A fast 8-ary implicit Priority queue
Jung, H. J. (2004) · The KIPS Transactions PartA · doi:10.3745/kipsta.2004.11a.3.213
Pisaruk, F. (2009) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.45.2009.tde-14072009-185725
Developments in Data Structure Research During the First 25 Years of FSTTCS
Seidel, R. (2005) · Lecture notes in computer science · doi:10.1007/11590156_3
Skalierbares und flexibles Live-Video Streaming mit der Media Internet Streaming Toolbox
Pranke, N. (2009) · Qucosa (Saxon State and University Library Dresden)
LDRD final report : massive multithreading applied to national infrastructure and informatics.
Henderson, B., Murphy, R. C., Wheeler, K., Mackey, G., Berry, J., LaViolette, R. A., Mancke, B., Barrett, B., Phillips, C. A., Pinar, A., et al. (2009) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/993883
Databases for moving objects in networks
de Almeida, V. T. (n.d.)
Konzeption und Implementierung eines OpenFlow-basierten IP-Multicast-Dienstes für Datenzentren
Danzl, J. (2013) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-3144
A New Single-Source Shortest Path Algorithm for Positive Weight Graph with O(m+kn) Time Complexity.Preprint
Li, Y. (2014) · arXiv (Cornell University)
Two-staged scheme for sub-goaling decomposition and ordering for path search problem
Jamil, M. S., & Alomary, A. (2004) · International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA) · doi:10.1109/ictta.2004.1307878
Kong, Z. (2012) · University of Minnesota Digital Conservancy (University of Minnesota)
An Approach to Real-Time Flexible Path Planning
Meng, A. C., Ntafos, S. C., & Tsoukalas, M. Z. (1992) · Springer eBooks · doi:10.1007/978-94-011-2526-0_29
PERFORMANCE ANALYSIS AND GRID COMPUTING ON WIDE AREA
Fenu, G., & Nitti, P. L. P. M. (2012) · UNICA IRIS Institutional Research Information System (University of Cagliari)
Szalay-Bekő, M. (2014) · SZTE Repository of Dissertations (University of Szeged) · doi:10.14232/phd.1963
Information-theoretic visual saliency detection
Pérez, P. S. (2011) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Estructura de datos para una implementación eficiente del problema del árbol generador mínimo
Cupe, P., & Hilarión, R. (2011) · Americanae (AECID Library)
A New Single-Source Shortest Path Algorithm for Nonnegative Weight GraphPreprint
Li, Y. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.1870
Relations between automata and the simple k-path problemPreprint
Basat, R. B., & Gabizon, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.5707
Maximale Flusse in fast-planaren Graphen
Informatik, V. F. (2007)
Speeding Up Shortest Path Algorithms
Brodnik, A., & Grgurovič, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35261-4_19
Maximum Gain Round Trips with Cost ConstraintsPreprint
Graf, F., Kriegel, H., & Schubert, M. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.0830
Analysis and design of advanced caching solutions for the modern Web
Huang, Q. (2014) · eCommons (Cornell University)
Integrating simulation and animation software systems through a generic computational engine
Walker, R. J. (2009) · cIRcle (University of British Columbia) · doi:10.14288/1.0051514
The last achievements in Steiner tree approximations
Zelikovsky, A. (1993) · DOAJ (DOAJ: Directory of Open Access Journals)
Kim, M., Choo, H., & Kim, W. H. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72588-6_77
Efficient load balancing for UBR traffic in ATM networks
Zhang, H., Imrich Chlamtac, A., & Faragó, A. (2003) · International Conference on Communications · doi:10.1109/icc.1999.767985
Maximale Flüsse in fast-planaren Graphen
Hochstein, J. M. (2008) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00000822
Visualization of heuristic-based multi-objective design space exploration of embedded systems
Taghavi, T. (2012) · UvA-DARE (University of Amsterdam)
de Villiers, H., Niesler, T., & van Zijl, L. (2010) · SUNScholar (Stellenbosch University)
Computing interesting topological features
Erickson, J., & Chambers, E. W. (2008)
Robust and Efficient Routing in Wireless Mesh Networks with Unreliable Nodes
Papapostolou, A., Friderikos, V., Ali‐Yahiya, T., & Chaouchi, H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04190-7_27
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
Osiakwan, C. N. K., & Akl, S. G. (1994) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/10637199408915464
On Linear time algoritm for SSSP Problem
Mitra, P., Hasan, R., & Kaykobad, M. (2002)
Algorithm for finding geodesic path based on rotation tree
Sun, H., & Li, H. (2010) · International Conference on Advanced Computer Theory and Engineering · doi:10.1109/icacte.2010.5579834
Average Costs of a Graph Exploration: Upper and Lower Bounds
Galli, N. (2000) · Journal of Algorithms · doi:10.1006/jagm.1999.1053
The UNB-RISC16 Object File Format
D’Amato, A. L. T., Ruiz, L. B., da Silva, A. F., Foleiss, J. H., da Costa, J. C., & Hübner, R. (2012) · International Conference of the Chilean Computer Science Society (SCCC) · doi:10.1109/sccc.2012.28
OUTDOOR VIEW RECOGNITION BASED ON LANDMARK GROUPING AND LOGISTIC REGRESSION
Todt, E., & Carme Torras, A. (2013) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001413550045
Pairing heaps, scrambled pairing and square-root trees
Elmasry, A. (2010) · International Journal of Computer Mathematics · doi:10.1080/00207160903029810
A Study on the Runtime Test of Priority Queues
Jung, H. (2010) · The KIPS Transactions PartA · doi:10.3745/kipsta.2010.17a.4.167
Improved Steiner Approximation Algorithm Based on Topology Analysis
Lei, G., Zhang, D., Wang, L., & ., S. H. (2004) · Information Technology Journal · doi:10.3923/itj.2005.11.15
On the second point-to-point undirected shortest simple path problem
Sedeño‐Noda, A., & González-Martín, C. (2012) · Optimization Letters · doi:10.1007/s11590-012-0528-y
Technical Note—A Note on Parametric Analysis in Linear Assignment
Volgenant, A. (2008) · Operations Research · doi:10.1287/opre.1070.0470
Computing an approximation of the 1-center problem on weighted terrain surfaces
Lanthier, M. A., Nussbaum, D., & Wang, T.-J. (2008) · ACM Journal of Experimental Algorithmics · doi:10.1145/1412228.1412231
I/O-Efficient Algorithms for Bounded Treewidth Graphs
Maheshwari, A., & Zeh, N. (2006)
COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE
Wulff‐Nilsen, C., Grüne, A., Klein, R., Langetepe, E., Lee, D. T., LIN, T.-C., Poon, S.-H., & YU, T.-K. (2012) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195912600035
Centrality-Burst Detection in Social Networks: An Efficient Approach for Data Stream
Mahanan, W., Natwichai, J., & Mori, K. (2014) · International Conference on Network-Based Information Systems · doi:10.1109/nbis.2014.17
Domshlak, C., & Gal, A. (2004) · eCommons (Cornell University)
Models and methods for the constrained shortest path problem and its variants
Pugliese, L. D. P. (2012) · 4OR · doi:10.1007/s10288-012-0197-9
SUGISONO, K., Yamazaki, H., Iwata, H., & Hiramatsu, A. (2012) · IEICE Transactions on Communications · doi:10.1587/transcom.e95.b.2315
Dynamic grooming, routing, and wavelength assignment for real-time optical networks
Wang, X., Brandt-Pearce, M., & Subramaniam, S. (2013) · Globecom · doi:10.1109/glocom.2013.6831421
Object-Based Multimedia Scheduling Based on Bipartite Graphs
Sun, H. M. (2005) · IEICE Transactions on Communications · doi:10.1093/ietcom/e88-b.1.372
Simulation relations for pattern matching in directed graphs
Björklund, J., & Öhman, L. (2013) · Theoretical Computer Science · doi:10.1016/j.tcs.2013.03.021
Realization of Matrices and Directed Graphs
Motwani, R. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0909
Shortest path computations in source-deplanarized graphs
Frederickson, G. N., Hambrusch, S. E., & Tu, H.-Y. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90227-z
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.