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,401–2,500 of 3,140
A note on meldable heaps relying on data-structural bootstrapping
Jensen, C. (2011) · Cited by 1
Disconnected Actions: An Asynchronous Extension to a Nested Atomic Action System
Ben-Zvi, B. (1990) · Defense Technical Information Center (DTIC) · doi:10.21236/ada221757 · Cited by 1
An information-theoretic approach to the robust shortest path problem
Tschirky, D. (2012) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-007554611 · Cited by 1
Improved Shortest Path Algorithms for Nearly Acyclic Directed Graphs
Tian, L., & Takaoka, T. (2012) · UC Research Repository (University of Canterbury) · doi:10.26021/1682 · Cited by 1
The origin-destination shortest path problemPreprint
Kodialam, M. S., & Orlin, J. B. (1993) · RePEc: Research Papers in Economics · Cited by 1
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
Babenko, M. A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92182-0_23 · Cited by 1
Fast C-K-R Partitions of Sparse GraphsPreprint
Mendel, M., & Schwob, C. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.1902 · Cited by 1
Applying Path Planning Algorithms to Train Schedules
Soethout, T. M. (2012) · Utrecht University Repository (Utrecht University) · Cited by 1
Probabilistic data structures for priority queues: Extended abstract
Sridhar, R., Rajasekar, K., & Rangan, C. P. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054362 · Cited by 1
Bernstein, A. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_563 · Cited by 1
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and LinksPreprint
Bhosle, A. M., & Gonzalez, T. F. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.1301 · Cited by 1
Bioinformatic methods for the analysis and comparison of metagenomes and metatranscriptomes
Ander, C. (2014) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 1
Efficient Algorithms and Routing Protocols for Handling Transient Single Node FailuresPreprint
Bhosle, A. M., & Gonzalez, T. F. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.3438 · Cited by 1
Constructing the spanners of graphs in parallel
Liang, W., & Brent, R. P. (2002) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/ipps.1996.508059 · Cited by 1
An O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphsPreprint
Rajabi-Alni, F., Bagheri, A., & Bidgoli, B. M. (2020) · doi:10.21203/rs.3.rs-19322/v1 · Cited by 1
A heuristic for channel routing
Lodi, E., & Preparata, F. P. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51295-0_125 · Cited by 1
A Simpler Scaling Algorithm for Weighted Matching in General Graphs.Preprint
Duan, R. (2014) · arXiv (Cornell University) · Cited by 1
Artificial Intelligence Approach of Optimal Route Selection in Telematics
Muneer-Ul-Haque, Raunak, M. S., Rahim, M. A., Delwar, T., & Haque, A. L. (2005) · Cited by 1
Finding multiple routing paths in wide-area WDM networks
Liang, W., & Shen, X. (2005) · Computer Communications · doi:10.1016/j.comcom.2005.01.009 · Cited by 1
New techniques for reversible compression of multispectral data
Memon, N. D., Sayood, K., & Magliveras, S. S. (1993) · AIAA Computers in Aerospace Conference · doi:10.2514/6.1993-4486 · Cited by 1
Two new criteria for finding Steiner hulls in Steiner tree problems
Provan, J. S. (1992) · Algorithmica · doi:10.1007/bf01758763 · Cited by 1
Finding the Anti-block Vital Node of a Shortest Path
Nie, Z., & Li, Y. (2009) · International Conference on New Trends in Information Science and Service Science · doi:10.1109/niss.2009.146 · Cited by 1
An algorithm for load balancing in multiprocessor systems
Loui, M. C., & Sohoni, M. A. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90049-4 · Cited by 1
Lim, A. E. B., & Sahni, S. K. (1992) · ACM Southeast Regional Conference (ACMSE) · doi:10.1145/503720.503783 · Cited by 1
Hamiltonian‐connected graphs and their strong closures
Wong, P. (1993) · International Journal of Mathematics and Mathematical Sciences · doi:10.1155/s0161171297001026 · Cited by 1
Approximation Algorithms for Geometric Networks
Andersson, M. (2007) · Lund University Publications (Lund University) · Cited by 1
Scan predictive vector quantization of multispectral images
Memon, N. D., & Sayood, K. (2002) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss.1994.399118 · Cited by 1
How to extract maximum information from event-driven topology updates
Rutenburg, V. V., & Ogier, R. G. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1993.253265 · Cited by 1
Breisgau, F. I. (1999) · Cited by 1
Efficient query distribution and positioning in public sensing systems
Baier, P. (2015) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-3590 · Cited by 1
On Preprocessing the Arc-Flags Algorithm
Baum, M. (2011) · Cited by 1
Augmenting geometric networks:computing the best shortcut
Rijkers, S. S. (2010) · TU/e Research Portal · Cited by 1
Utility-based map reduction for ground and flight vehicle navigation
Steiner, T. J. (2015) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Modeling and computation of vernacular regions
Meulemans, W. (2010) · TU/e Research Portal · Cited by 1
Ohara, Y., & Imahori, S. (2007) · Cited by 1
Learning with mistures of trees
Meilă, M. (1999) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
A Framework for Estimating Energy Consumed by Electric Loads Through Minimally Intrusive Approaches
Giri, S. (2015) · KiltHub Repository · doi:10.1184/r1/6714302 · Cited by 1
A Low-Complexity Binary-Heap Implementation of Dijkstra's AlgorithmPreprint
Constantinou, C. K., Ellinas, G., & Panayiotou, C. G. (2014) · arXiv (Cornell University) · Cited by 1
Field D* Pathfinding in Weighted Simplicial Complexes
Perkins, S. J. (2013) · Open University of Cape Town (University of Cape Town) · Cited by 1
Gfeller, B. (2009) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-005920166 · Cited by 1
Facoltà di Scienze Matematiche Fisiche e Naturali
Pietrelli, F. (2011) · Cited by 1
Fast Shortest Path Routing in Transportation Networks with Time-Dependent Road SpeedsPreprint
Constantinou, C. K., Ellinas, G., Panayiotou, C. G., & Polycarpou, M. M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.4113 · Cited by 1
Towards a Final Analysis of Pairing Heaps
Pettie, S. (2006) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagsemproc.06091.5 · Cited by 1
On Solving Floating Point SSSP Using an Integer Priority QueuePreprint
Otte, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.00726 · Cited by 1
Network Flow Problems Arising From Evacuation Planning
Dressler, D. (2012) · DepositOnce · doi:10.14279/depositonce-3327 · Cited by 1
An Improved Algorithm for Finding the Anti-block Vital Edge of a Shortest Path
Nie, Z., & Li, Y. (2008) · Cited by 1
Harel, D., & Feldman, Y. (1987) · Springer eBooks · doi:10.1007/978-3-642-27266-0_6 · Cited by 1
A New Approximate Algorithm for the Minimum k-Cut Problem by Using Minimum Range k-Cut Algorithm
Dai, Y., Iwano, K., & Katoh, N. (1994) · IEEJ Transactions on Electronics Information and Systems · doi:10.1541/ieejeiss1987.114.4_438 · Cited by 1
Hochbaum, D. S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.04012 · Cited by 1
Models and Algorithms for Sustainable Journey Planning
Hrnčíř, J. (2016) · Czech Technical University Digital Library (Czech Technical University in Prague) · Cited by 1
On optimization of update propagation in multidatabase systems
Orłowski, M., & Cao, J. (2002) · IEEE Region 10 Conference (TENCON) · doi:10.1109/tencon.1993.319991 · Cited by 1
Reducing non-recurrent urban traffic congestion using vehicle re-routing
Wang, S. (2016) · Dublin City University Open Access Institutional Repository (Dublin City University) · Cited by 1
Kramer, L. (2014) · heiDOK (Heidelberg University) · doi:10.11588/heidok.00016013 · Cited by 1
Zarrinmehr, S. (2016) · OakTrust (Texas A&M University Libraries) · Cited by 1
Solving Assignment and Routing Problems in Mixed Traffic Systems
Nguyen, T. N. (2016) · heiDOK (Heidelberg University) · doi:10.11588/heidok.00020617 · Cited by 1
Fischer, T. G. (2007) · mediaTUM (Technical University of Munich) · Cited by 1
Rumor source identification in complex networks
Jiang, J. (2017) · Figshare · Cited by 1
Sandur, A., Elgamal, T., Agha, G., & Nahrstedt, K. (2018) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1
Investigation of Si1-xGex alloy formation by using STM
Oral, A. (1994) · Bilkent University Institutional Repository (Bilkent University) · Cited by 1
Comparação de algoritmos para o Problema dos K Menores Caminhos
Kykuta, D. H. (2018) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.45.2018.tde-20032018-003225 · Cited by 1
Heuristic methods for solving two discrete optimization problems
García, C., & Xavier, J. C. (2018) · ERA · Cited by 1
Solve For Shortest Paths Problem Within Logarithm RuntimePreprint
Tan, Y. K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.07463 · Cited by 1
Numerical scalar curvature deformation and a gluing construction
Daszuta, B. (2019) · Otago University Research Archive (University of Otago) · Cited by 1
Shortest Path Algorithms between Theory and PracticePreprint
Shokry, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.07448 · Cited by 1
Resource Assignment for Fiber Optic Networks
Wang, X. (2014) · doi:10.18130/v3dp0x · Cited by 1
Approximation Algorithms for the Loop Cutset ProblemPreprint
Becker, A., & Geiger, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.6787 · Cited by 1
Single source shortest paths in $H$-minor free graphsPreprint
Yuster, R. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.2970 · Cited by 1
An exploration of graph algorithms and graph databases
Balaghan, P. (2019) · Repository@Hull (Worktribe) (University of Hull) · Cited by 1
Representation of distribution networks of ships using graph-theory
Maurizio, A. (2018) · SDL · Cited by 1
Information carefull worstcase DecreaseKey heaps with simple nonMeld variantPreprint
Majerech, V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.04372 · Cited by 1
Tie Strength, Optimal Connections, and Distance in Social Networks
Buch, D. A. (2019) · The Research Repository @ WVU (West Virginia University) · doi:10.33915/etd.7400 · Cited by 1
Michailidis, G. C. (2014) · Wiley eBooks · doi:10.1002/9781118445112.stat06487 · Cited by 1
New polynomial-time cycle-canceling algorithms for minimum cost flowsPreprint
Sokkalingam, P. T., Ahuja, R. K., & Orlin, J. B. (1996) · RePEc: Research Papers in Economics · Cited by 1
Safety of Flow Decompositions in DAGs.Preprint
Khan, S., & Tomescu, A. I. (2021) · arXiv (Cornell University) · Cited by 1
Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees
Karger, D. R. (n.d.) · Cited by 1
An O(log n) Time Common CRCW Pram Algorithm for Minimum Spanning Tree.
Wu, M. M. (1990) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1
Efficient Algorithms for Graph Optimization Problems
Kovács, P. (2019) · Eötvös Loránd Tudományegyetem · doi:10.15476/elte.2019.029 · Cited by 1
A solver for the Steiner tree problem with few terminals
Schidler, A. (2018) · reposiTUm (TU Wien) · doi:10.34726/hss.2018.55931 · Cited by 1
Nowak, C. (2014) · HilDok – Institutional Repository (Universität Hildesheim) · doi:10.25528/401 · Cited by 1
Berechnung der Trajektorien für die Entwicklung von optimalen Routen
Zazai, M. F. (2020) · Digital Repository of the BTU Cottbus – Senftenberg (Brandenburg University of Technology) · doi:10.26127/btuopen-5228 · Cited by 1
JHeaps: An open-source library of priority queues
Michail, D. (2021) · SoftwareX · doi:10.1016/j.softx.2021.100869 · Cited by 1
A Randomized Queueless Algorithm for Breadth-First Search.
Subramani, K., & Madduri, K. (2008) · Int. J. Comput. Their Appl. · Cited by 1
(1992) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70201-2 · Cited by 1
Harel, D., & Feldman, Y. (2008) · Unitext · doi:10.1007/978-88-470-0580-8_18 · Cited by 1
A sequential dual simplex algorithm for the linear assignment problem
Akgül, M. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90012-6 · Cited by 1
Nagamochi, H. (2007) · Springer eBooks · doi:10.1007/978-3-540-77120-3_4 · Cited by 1
An O(n3) time algorithm for the maximum weight b-matching problem on bipartite graphsPreprint
Rajabi-Alni, F., Bagheri, A., & Bidgoli, B. M. (2020) · doi:10.21203/rs.3.rs-21467/v1 · Cited by 1
A top down unification of minimum cost spanning tree algorithms
Merritt, S. M. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75259 · Cited by 1
Models and algorithms for simple disjunctive temporal problemsPreprint
Sartori, C. S., Smet, P., & Berghe, G. V. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2302.02644 · Cited by 1
The Logarithmic Funnel Heap: An Efficient Priority Queue For Extremely Large SetsPreprint
Loeffeld, C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10648 · Cited by 1
Padovan heapsPreprint
Majerech, V. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.10812 · Cited by 1
List HeapsPreprint
Frohmader, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.05662 · Cited by 1
dodgr: Distances on Directed Graphs
Padgham, M., Petutschnig, A., & Cooley, D. (2017) · doi:10.32614/cran.package.dodgr · Cited by 1
Finding the Center and Centroid of a Graph with Multiple SourcesPreprint
Chou, M. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2408.13688 · Cited by 1
Fairness-Aware Dense Subgraph DiscoveryPreprint
Kariotakis, E., Sidiropoulos, N. D., & Konar, A. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2412.02604 · Cited by 1
Proceedings of the 1st FastCode Programming Challenge
(2025) · doi:10.1145/3711708 · Cited by 1
A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite GraphsPreprint
Kwok, S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2502.20889 · Cited by 1
The Diameter of Polytopes and Related Applications
Kleinschmidt, P. (1994) · Springer eBooks · doi:10.1007/978-94-011-0924-6_18 · Cited by 1
Synthèse architecturale flexible
Cesário, W. (1999) · HAL · Cited by 1
Traffic Control in Packet Switched Networks
Adamovic, L. (2010) · Dublin City University Open Access Institutional Repository (Dublin City University) · Cited by 1
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.