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,901–3,000 of 3,140
Towards real-time safe flight paths for urban air mobility
Gutierrez, J. (2024) · Digital Repository Service (Northeastern University) · doi:10.17760/d20659750
Exact Algorithms for Weighted Rectangular Covering Problems
Umeda, R., Wu, W., Hu, Y., & Hashimoto, H. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-64605-8_2
Linear-algebraic implementation of Fibonacci heap
Demin, D., Валерьевич, С. Д., & Moiseev, S. (2024) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.v28i1.2926
Liu, T., & LUO, C. (2024) · International Conference on Applied Mathematics, Modelling and Intelligent Computing (CAMMIC) · doi:10.1117/12.3036576
Randomized protocols for resilient peer-to-peer networks
Tanaka, R., & Zhu, Y. (2024) · Procedia Computer Science · doi:10.1016/j.procs.2024.08.004
On the aggregation of FIBs at ICN routers using routing strategy
Nakamura, R., & Kamiyama, N. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110794
Online Incentive Protocol Design for Reposting Service in Online Social Networks
Gu, H., Zheng, S., Liu, X., Xie, H. L., & Lui, J. C. S. (2024) · ACM Transactions on the Web · doi:10.1145/3696473
Brief Announcement: Towards Proportionate Fair Assignment
Schieber, B. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-74498-3_18
FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin SharesPreprint
Jansen, K., Lassota, A., Tutas, M., & Vetta, A. R. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2409.04225
An alignment problemPreprint
McDaniel, E. L., Mikler, A. R., Tiwari, C., & Patterson, M. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2411.08792
Depth-First Search and Research of Algorithms Related to Bipartite Graphs
Wang, J. (2024) · Applied and Computational Engineering · doi:10.54254/2755-2721/2025.17858
Geometry helps in routing scalabilityPreprint
Piekenbrock, M. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2412.07964
TSN cfgNCT: Practical Implementation of a TSN Configurator with Negligible Computation Time
Jiang, J., Jin, S., Yu, M., Song, W. S., Kim, Y. C., Hong, S. H., Lee, H. H., & Kim, H. (2024) · IEEE International Conference on Industrial Informatics (INDIN) · doi:10.1109/indin58382.2024.10774293
New bounds for the number of lightest cycles in undirected graphs
Aissi, H., Baïou, M., & Barahona, F. (2024) · Information Processing Letters · doi:10.1016/j.ipl.2024.106555
Solving the all pairs shortest path problem after minor update of a large dense graphPreprint
Liu, G. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2412.15122
System Optimization in Industrial Engineering: Historical Perspectives, Progress and Prospects
Choi, I.-C., Sohn, M.-S., & Jun, Y.-M. (2024) · Journal of Korean Institute of Industrial Engineers · doi:10.7232/jkiie.2024.50.6.418
Minimum Complete Pareto Front of a Biobjective Minimum Spanning Trees Problem
Laskov, L. M., & Marinov, M. L. (2024) · International Conference Automatics and Informatics (ICAI) · doi:10.1109/icai63388.2024.10851587
Automated focusing and exposure control of camera for satellite observation and debry survey
Desai, J., Desai, A., & Bhatt, N. (2025) · AIP conference proceedings · doi:10.1063/5.0254746
Faster Algorithms for Constructing Frequency Difference Consensus Trees
Wang, B.-F., Li, C.-Y., & Sheu, W.-H. (2025) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2025.3545871
Complete Pareto Front of the Minimal Length Maximal Capacity Shortest Path Problem
Laskov, L. M., & Marinov, M. L. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-74758-8_3
A Unified Framework for the Optimizability of Non-isotonic Routing Metrics
Saad, M., & Abdallah, S. (2024) · IEEE/ACM International Conference on Utility and Cloud Computing (UCC) · doi:10.1109/ucc63386.2024.00051
Эффективный поиск минимального дерева на точках пространства в $l_1$-норме
Kaymakov, K. V., & Malyshev, D. S. (2025) · Математические заметки · doi:10.4213/mzm14366
Fair Selection of Clearing Schemes for Kidney Exchange Markets
Barish, R. D., & Shibuya, T. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-4448-3_14
Distributed Edge Computation for Finding an Optimal Meeting Location
Chou, M. (2025) · 2012 International Conference on Computing, Networking and Communications (ICNC) · doi:10.1109/icnc64010.2025.10993620
Efficient execution of top-k closeness centrality queries
Olsen, P. W. (2016) · Scholars Archive - University at Albany (University at Albany, State University of New York) · doi:10.54014/9ct7-jfv7
An Outline of Inverse Combinatorial Optimization Problems
Guan, X., Pardalos, P. M., & Zhang, B. (2025) · Springer optimization and its applications · doi:10.1007/978-3-031-91175-0_1
The Social Sphere Model: Heuristic Influence Prediction in Evolving NetworksPreprint
Schaposnik, L. P., Lin, M., & Wu, R. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5403058
Comparative Performance Analysis of Some Priority Queue Variants in Dijkstra’s Algorithm
Idowu, A. I., Olabiyisi, S. O., Alo, O. O., Adeleke, I. A., Jokotoye, A. A., & Omotade, A. L. (2025) · International journal of research and scientific innovation · doi:10.51244/ijrsi.2025.120800078
Efficient Search for a Minimum Tree in a Space with the $$l_1$$-Norm
Kaymakov, K. V., & Malyshev, D. S. (2025) · Mathematical Notes · doi:10.1134/s000143462560276x
Dynamic Sensor Scheduling for Spatio-Temporal Monitoring of Water Bodies
Deshpande, V. M., & Vinod, A. P. (2025) · IEEE Conference on Control Technology and Applications (CCTA) · doi:10.1109/ccta53793.2025.11151521
A Heuristic Algorithm for Shortest Path SearchPreprint
Yu, H., Wang, X., & Luo, Y. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2506.19349
Secure Virtual Network Embedding Through Fully Homomorphic Encryption
Cousins, D. B., Pascoe, C., & Kline, E. (2025) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec67600.2025.11196202
Data-driven Energy and Power Demand Estimation for Electric Freight Transport in FinlandPreprint
Chkhartishvili, N., Costa, A. M., Aushev, A., & Pihlatie, M. H. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5854482
New heuristics for the minimum fundamental cut basis problemPreprint
Tchernov, A. J. P., & Schwahn, A. M. (2007) · Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)
Exploring Two-Sided Business Models for Service Providers
Agusleo, H., Uy, J., Izdebski, L., Puopolo, S. A., & Shen, D. (2010)
Körte, B., Vygen, J., Fonlupt, J., & Skoda, A. (2010) · Springer eBooks · doi:10.1007/978-2-287-99037-3_7
Finding a Low-Diameter and Low-Weight k-Connected Subgraph
Liang, W., Havas, G., & Street, A. (1999) · Congressus Numerantium
Tree comparison: enumeration and application to cheminformatics
Droschinsky, A. (2021) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-22479
Konstruktiv hierarchischer Ansatz zur Platzierung und Verdrahtung analoger integrierter Schaltungen
Lipka, B. (2012) · Digitalen Hochschulbibliothek Sachsen-Anhalt (Universitäts- und Landesbibliothek Sachsen-Anhalt) · doi:10.25673/5449
Bethlehem, T. (2008) · UC Research Repository (University of Canterbury) · doi:10.26021/1447
Discrete-time Contraction Analysis and Controller Design for Nonlinear Processes
Wei, L. (2022) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/24419
Μελέτη τεχνικών βελτιστοποίησης για εφαρμογές με μη κανονικές προσβάσεις στη μνήμη
Kanellopoulos, K. (2018) · DSpace - NTUA (National Technical University of Athens) · doi:10.26240/heal.ntua.15231
Schweikert, A. E., L’Her, G., & Deinert, M. R. (2021) · Figshare · doi:10.6084/m9.figshare.14775657
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
Ma, Z. (2022) · UNSWorks (University of New South Wales, Sydney, Australia) · doi:10.26190/unsworks/24864
Δυναμική Επιλογή Μεταφορικού Μέσου για Αλληλοεξαρτώμενες Μετακινήσεις με Μεταβαλλόμενους Προορισμούς
Γκιοτσαλίτης, Κ., & Gkiotsalitis, K. (2017) · DSpace - NTUA (National Technical University of Athens) · doi:10.26240/heal.ntua.2776
On linear, fractional, and submodular optimization
Koh, Z. K. (2023) · London School of Economics and Political Science Theses Online (London School of Economics and Political Science) · doi:10.21953/lse.00004463
DiVerG: Scalable Distance Index for Validation of Paired-End Alignments in Sequence GraphsPreprint
Ghaffaari, A., Schönhuth, A., & Marschall, T. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.02.12.637964
LIPIcs, Volume 1, STACS'08, Complete Volume
Albers, S., & Weil, P. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2008
Enhancing Generalized Compressed Suffix Trees, with Applications
Chakraborty, S., Sadakane, K., & Zuba, W. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.isaac.2024.18
Star Partitioning : Improving Multilevel Graph Partitioning Using Peripheral Nodes
Maas, N. (2023) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000162230
Oie, T., 立花, 篤., ANO, S., KOIKE, A., & Murakami, H. (2011) · Institutional Repositories DataBase (IRDB) · doi:10.15018/00000809
On hierarchical search and preference-based routing in transportation networks
Proissl, C. (2023) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-13360
Improved shortest path algorithms for nearly acyclic graphs
Saunders, S. (2004) · UC Research Repository (University of Canterbury) · doi:10.26021/2806
Visibility-Preserving Movement for Teams - Algorithms for Walking Minimal Paths
Fenwick, J. (2008) · Griffith Research Online · doi:10.25904/1912/759
More Parallelism in Single-Source Shortest Path Algorithms: Simulation and Implementation
Kainer, M. (2018) · reposiTUm (TU Wien) · doi:10.34726/hss.2018.49709
Randomized $\tilde{O}(m\sqrt{n})$ Bellman-Ford from Fineman and the BoilermakersPreprint
Rao, S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2503.22613
社会的ネットワークにおける効率的な重要ノードの発見の手法とその応用
田畑, 公. (2017) · Hokkaido University Collection of Scholarly and Academic Papers (Hokkaido University) · doi:10.14943/doctoral.k12816
Tessellations for Geometric Optimization
Jaume Deyà, R. (2015) · Universitätsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver · doi:10.17169/refubium-4622
Berechnung kürzester Wege mit negativen Kantenkosten
Holtz, P. (2024) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-14624
Ανάπτυξη εφαρμογής διαδικτύου για το σχεδιασμό βέλτιστου ιστιοπλοϊκού πλου βάσει καιρικών συνθηκών
Κονταρίνης, Σ. (2016) · DSpace - NTUA (National Technical University of Athens) · doi:10.26240/heal.ntua.4653
Revisiting FastMap: New ApplicationsPreprint
Li, A. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2503.11908
Heydari, R. (n.d.) · Digital Repository Service (Northeastern University)
A Systematic Approach to Regular-Expression-Based Queries on Big Graphs
LE, D. T., レ, ダ. タ., & Tung, L.-D. (2016) · SOKENDAI (Graduate University for Advanced Studies)
Using Cycles and Scaling in Parallel Algorithms
Stein, C. (1989) · DSpace@MIT (Massachusetts Institute of Technology)
Briquet, C. (2003) · ORBi (University of Liège)
A few randomized protocols in peer-to-peer networks
Tanaka, R. (2019) · e-scholar@UOIT (University of Ontario Institute of Technology)
Lyhimmän polun laskennan tehostaminen tieverkossa
Brigatti, J. (2009) · Jyväskylä University Digital Archive (University of Jyväskylä)
Minimum Spanning Tree Algorithms, one-dimensional ranking and comparison.
Frieden, M. H. (2021) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)
Online Bipartite Matching under Markov Chain Model
Ishaan, A. (2024) · Spectrum Research Repository (Concordia University)
Υλοποίηση και εκτίμηση δομών σωρού
Καρπάτσης, Γ. Α. (2011) · University of Thessaly Institutional Repository (University of Thessaly)
Πλοήγηση πράκτορα σε δισδιάστατο χώρο
Φωτιάδης-Κρικέλης, Α. Κ. (2020) · University of Thessaly Institutional Repository (University of Thessaly)
階層グラフ書換えモデルを拡張したHyperLMNtalの実現
Ogawa, S., & 小川, 誠. (2011) · Institutional Repositories DataBase (IRDB)
(2021) · UpSpace Institutional Repository (University of Pretoria)
Implementación y análisis del algoritmo Fast Marching y sus distintas versiones
Muñoz Gely, P. (2014) · e-Archivo (Carlos III University of Madrid)
明昌, 森., 松崎, 公., & 武市, 正. (2011) · Institutional Repositories DataBase (IRDB)
Multimodale parallele Simulation des Verkehrsflusses in großen Netzen
Moltenbrey, M. (2009)
An algorithm for the solution of shortest path problems with positive and negative arc lengths
Dorhout, B., & Hunting, M. M. G. (1998) · University of Twente Research Information
Practical performance of different implementations of the priority queue
Schierreich, Š., & Šimon, S. (2018) · Czech Technical University Digital Library (Czech Technical University in Prague)
Papangelis, E. (2015) · TSpace (University of Toronto)
大規模最短路問題に対するダイクストラ法の高速化 (最適化モデルとアルゴリズムの新展開)
安井, 雄., 藤澤, 克., 鳥海, 重., 田口, 東., 藤澤克樹, & Fujisawa, K. (2011) · Kyoto University Research Information Repository (Kyoto University)
COMPUTING INTERESTING TOPOLOGICAL FEATURES
Chambers, E. W. (2008) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Efficient algorithms for computing distances between one-dimensional point sets
Colannino, J. (2005) · eScholarship@McGill (McGill) · doi:10.82308/29697
Graph algorithms for approximate and dynamic settings in the external-memory model
Veith, D. (2020) · Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt)
Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls
Masoudi, N. (2017) · TigerPrints (Clemson University)
A Performance Study of Priority Queues: Binary Heap, Fibonacci Heap, Hollow Heap
Tjernström, K. J., & Paulsson, V. (2025) · Lund University Publications Student Papers (Lund University)
Karjalainen, S. (2017) · Tampere University Institutional Repository (Tampere University)
Khan, M. A. (2022) · Mspace (University of Manitoba)
Relaying Techniques for Multi Hop Differential Transmitted Reference IR-UWB Systems
Mondelli, M. (2012) · Electronic Theses and Dissertations Repository (University of Pisa)
Fachriansyah, M. H. (2023) · Repository at Universitas Pendidikan Indonesia (Universitas Pendidikan Indonesia)
Community Detection in Networks: Models and Algorithms
Miyauchi, A. (2017) · Institutional Repositories DataBase (IRDB)
Efficient Merge and Insert Operations for Binary Heaps and Trees
Woo, A. C., & Kuszmaul, C. L. (2000) · NASA STI Repository (National Aeronautics and Space Administration)
Exploring the visualization of student behavior in interactive learning environments
Johnson, M. W., & NC DOCKS at The University of North Carolina at Charlotte (2013) · NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro)
Shortest Path Approximation and Optimal Transport with Flow-rate Constraints
Dong, A. (2023) · eScholarship (California Digital Library)
大規模最短路問題に対する高速処理システム : メモリ階層構造の考慮とクラスタ&クラウド技術による高速化 (21世紀の数理計画 : アルゴリズムとモデリング)
Yasui, Y., 高宮, 安., Fujisawa, K., & Fujisawa, K. (2010) · Kyoto University Research Information Repository (Kyoto University)
AZZINI, A. (2014) · Electronic Theses and Dissertations Repository (University of Pisa)
Unit 064 - Representing Networks
064, C. I. G., & Zhan, F. B. (2000) · eScholarship (California Digital Library)
Heuristic Algorithms for Classical STRIPS Planning Problems
Imai, T. (2015) · Institutional Repositories DataBase (IRDB)
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.