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,801–2,900 of 3,140
A Study on Reactive and Proactive Push-Pull/Make-Before-Break Defragmentation For Dynamic RMSA
Ma, Y. (2019) · Spectrum Research Repository (Concordia University)
Selectable Heaps and Their Application to Lazy Search Trees
Zhang, L. (2021) · UWSpace (University of Waterloo)
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.005
On an Ordering Problem in Weighted Hypergraphs
Damaschke, P. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-79987-8_18
Advances in Urban Traffic Network Equilibrium Models and Algorithms
Wang, D. (2021) · TU/e Research Portal
Advancing Urban Mobility with Algorithm Engineering
Buchhold, V. (2021) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000136217
Efficient Network Analysis Under Link DeletionPreprint
Ward, M., Datta, A., Nguyen, H., & Eshraghian, J. K. (2021) · arXiv (Cornell University)
RESOURCE MANAGEMENT AND ALLOCATION IN COMPUTER AND COMMUNICATION NETWORKS
Gong, Z. (2003) · University of Minnesota Digital Conservancy (University of Minnesota)
Efficient Network Analysis Under Single Link DeletionPreprint
Ward, M., Datta, A., Nguyen, H., & Eshraghian, J. K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.06891
Shared Mobility - Operations and Economics
Tafreshian, A. (2021) · Deep Blue (University of Michigan) · doi:10.7302/2888
Maintaining Constrained Path Problem for Directed Acyclic Graphs
Hao, C., Zhang, S., & Weihua Yang, A. (2021) · Journal of Interconnection Networks · doi:10.1142/s021926592150016x
Random Sampling Techniques in Parallel Algorithms
Raman, R. (1999) · Combinatorial optimization · doi:10.1007/978-1-4613-3282-4_3
Theoretical and practical eciency of priority queues
Jensen, C. (2006)
Αλγόριθμοι διαχείρισης δεδομένων και εξαγωγή γνώσης σε εφαρμογές γράφων
Παπαδημητρίου, Α.-Μ. (2012) · doi:10.12681/eadd/27399
Geometric Shortest Path Containers
Wagner, D., Zaroliagis, C., Wagnery, D., Willhalmy, T., & Zaroliagisz, C. (2004)
(2008) · Springer eBooks · doi:10.1007/978-3-540-76919-4_7
(2005) · Springer eBooks · doi:10.1007/3-540-29297-7_7
Spanning Trees and Arborescences
(2007) · Springer eBooks · doi:10.1007/978-3-540-71844-4_6
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.001
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.011
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.002
Minimum-Cost Circulation Algorithms
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.007
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.010
Multicommodity Flow Algorithms
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.009
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.008
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.012
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.006
Najman, L. A., & Talbot, H. (2013) · Wiley eBooks · doi:10.1002/9781118600788.biblio
Preliminaries: Shortest Path Algorithms
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.003
(2007) · Springer eBooks · doi:10.1007/978-3-540-71844-4_7
Dynamic transport mode estimation subject to joint decisions and spatio-temporal variationsPreprint
Gkiotsalitis, K. (2019) · doi:10.31224/osf.io/9y65h
Kasyanov, V. N., & Evstigneev, V. A. (2000) · Springer eBooks · doi:10.1007/978-94-011-4122-2_3
ALGORITHMS OF ELECTRIC NETWORK CONTROL OF A HYBRID POWER SUPPLY SYSTEM OF AUV
Kiselev, N. K., & Мартынова, Л. А. (2022) · Известия Южного федерального университета. Технические науки · doi:10.18522/2311-3103-2021-7-76-91
Selecting and scheduling an optimal subset of road network upgradesPreprint
Stivala, A. D., Stuckey, P. J., & Wallace, M. G. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2204.10175
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.013
Shortest path algorithms for nearly acyclic directed graphs
Takaoka, T. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62559-3_29
(1992) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70200-0
Gabow, H. N. (2013) · Discrete mathematics and its applications · doi:10.1201/b16132-71
Equivalence Between Priority Queues and Sorting
Chowdhury, R. (2015) · Springer eBooks · doi:10.1007/978-3-642-27848-8_127-2
(1988) · Annals of Operations Research · doi:10.1007/bf02288319
Körte, B., & Vygen, J. (2018) · Springer eBooks · doi:10.1007/978-3-662-57691-5_7
Decremental All-Pairs Shortest Paths
Demetrescu, C., & Italiano, G. F. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_102
Spanning Trees and Arborescences
(2005) · Springer eBooks · doi:10.1007/3-540-29297-7_6
Körte, B., & Vygen, J. (2002) · Algorithms and combinatorics · doi:10.1007/978-3-662-21711-5_7
Jungnickel, D. (2012) · Algorithms and computation in mathematics · doi:10.1007/978-3-642-32278-5_3
(1992) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)70199-7
Güting, R. H., & Dieker, S. (2003) · Leitfäden der Informatik · doi:10.1007/978-3-322-91882-6_5
Skiena, S. (2009) · Springer eBooks · doi:10.1007/978-1-84800-070-4_12
(2006) · Springer eBooks · doi:10.1007/3-540-37437-x_6
(2011) · Elsevier eBooks · doi:10.1016/b978-0-12-372512-7.00020-1
Spanning Trees and Arborescences
Körte, B., & Vygen, J. (2002) · Algorithms and combinatorics · doi:10.1007/978-3-662-21711-5_6
Körte, B., & Vygen, J. (2012) · Springer eBooks · doi:10.1007/978-3-642-25401-7_7
Körte, B., & Vygen, J. (2011) · Unitext · doi:10.1007/978-88-470-1523-4_7
Güting, R. H. (1992) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-92105-5_5
Aufspannende Bäume und Arboreszenzen
Körte, B., & Vygen, J. (2018) · Springer eBooks · doi:10.1007/978-3-662-57691-5_6
Turau, V. (2004) · Oldenbourg Wissenschaftsverlag eBooks · doi:10.1524/9783486593778.bm
Schmidt, M. (2013) · Springer optimization and its applications · doi:10.1007/978-1-4614-9566-6_1
Aufspannende Bäume und Arboreszenzen
(2008) · Springer eBooks · doi:10.1007/978-3-540-76919-4_6
Path Problems in Geographic Information Systems
Omran, M. T. (2014) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2014-10369
Erciyes, K. (2014) · CRC Press eBooks · doi:10.1201/b17409-8
Linking Off-Road Points to Routing Networks
Köppl, D. (2022) · Algorithms · doi:10.3390/a15050163
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
Ding, W., Qiu, K., Zhou, Y., & Ye, Z. (2022) · Journal of Combinatorial Optimization · doi:10.1007/s10878-022-00866-x
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
Li, J., Wang, W., Lichen, J., Liu, S., & Pan, P. (2022) · Journal of Global Optimization · doi:10.1007/s10898-022-01163-x
Offline Key Station and Path Impedance Based Subway Route Recommendation Method
戴, 政. (2022) · Hans Journal of Data Mining · doi:10.12677/hjdm.2022.123025
Dijkstra’s Single Source Shortest Path Algorithm
Thorup, M. (2022) · ACM eBooks · doi:10.1145/3544585.3544589
Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters
Sao, P. (2021) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)
Bernstein, A. (2015) · Springer eBooks · doi:10.1007/978-3-642-27848-8_563-1
Ortega‐Arranz, H., Llanos, D. R., & González-Escribano, A. (2015) · Synthesis lectures on theoretical computer science · doi:10.1007/978-3-031-02574-7_7
Decremental Approximate-APSP in Directed Graphs
Bernstein, A. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_564
SONIK: Efficient In-situ All Item Rank Generation using Bit OperationsPreprint
Dutta, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.06992
Fracturing of Optimal Paths in a Random Lattice
Voigt, A. (2011) · BIBSYS Brage (BIBSYS (Norway))
Stoop, K., Pickavet, M., Colle, D., & Audenaert, P. (2022) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc55140.2022.9921972
Finding optimal non-datapath caching strategies via network flow
Lyons, S., Rangaswami, R., & Xie, N. (2023) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.12.036
Reconstruction of Human Trajectories Based on Anonymous Sensor Data for Estimating Infection Route
Matsuda, K., Ikeuchi, H., Takahashi, Y., & Toyono, T. (2022) · Globecom · doi:10.1109/globecom48099.2022.10001732
A Study of Non-datapath Cache Replacement Algorithms
Lyons, S. (2021) · FIU - Digital Commons (Florida International University) · doi:10.25148/etd.fidc009577
A short note on Layman permutations
Hajnal, P. (2022) · Acta Universitatis Sapientiae Mathematica · doi:10.2478/ausm-2022-0015
Decoding probabilistic syndrome measurement and the role of entropyPreprint
Doriguello, J. F. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2302.11631
Solving Third-Order Linear Recurrence Relations with Applications to Number Theory and Combinatorics
Bagdasaryan, A. G. (2023) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-031-25225-9_5
On the Shared Transportation Problem: Computational Hardness and Exact Approach
Davot, T., Giroudeau, R., & König, J. (2023) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054123410058
Quinton, F., Grand, C., & Lesire, C. (2023) · Revue Ouverte d Intelligence Artificielle · doi:10.5802/roia.58
Golden Proportion in Computational Analysis: Reflecting the Universal Beauty
Gopinath, N. (2023) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.8155032
Bodenstein, G. J., Kruger, M. F., Brydon, H., & Blignaut, R. J. (2023) · Research Square · doi:10.21203/rs.3.rs-3198347/v1
Advanced Priority Queues in the OPTICS Clustering Algorithm
Galcik, P., Mrena, M., Piatriková, L., & Stankevich, S. A. (2023) · International Conference on Information and Digital Technologies (IDT) · doi:10.1109/idt59031.2023.10194445
Scheduling Problems in the Service Industry: Theory and Applications
van Staereling, I. V. H. (2023) · doi:10.5463/thesis.196
Dutta, A., & Kumar, P. K. (2023) · Lecture notes in electrical engineering · doi:10.1007/978-981-99-5080-5_29
Path Planning for UAV-Aided Wireless Positioning System Calibration
Wu, Z., Zheng, Y., & Lu, M. (2023) · Proceedings of the Satellite Division's International Technical Meeting (Online)/Proceedings of the Satellite Division's International Technical Meeting (CD-ROM) · doi:10.33012/2023.19218
List Of Pareto Optimal Solutions of a Biobjective Shortest Path Problem
Laskov, L. M., & Marinov, M. L. (2023) · Annals of Computer Science and Information Systems · doi:10.15439/2023f3718
Titov, A., Drouin, S., & Kersten‐Oertel, M. (2023) · JMIR Neurotechnology · doi:10.2196/45828
Edge Manipulations for the Maximum Vertex-Weighted Bipartite b-matchingPreprint
Auricchio, G., Ma, Q., & Zhang, J. (2023) · Research Square · doi:10.21203/rs.3.rs-3472707/v1
k-shortest path: average-case analysis and practical improvements
Schickedanz, A. (2023) · Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt) · doi:10.21248/gups.78731
Path Planning in a Weighted Planar Subdivision Under the Manhattan Metric
Davoodi, M., & Safari, A. (2024) · Graphs and Combinatorics · doi:10.1007/s00373-023-02744-7
Rouquette, L. (2022) · theses.fr (ABES) · doi:10.70675/4a47f08eze1adz4378za3d3z8108bb6b51b5
Snapshot-Optimal Real-Time Ride Sharing
Hassan, A., Wallace, M. G., Moser, I., & Harabor, D. (2024) · Information · doi:10.3390/info15040174
Luttringer, J.-R. (2022) · theses.fr (ABES) · doi:10.70675/db29b7b5z96b2z4600za45ez99fd534f02fd
Heaps SimplifiedPreprint
Haeupler, B., Sen, S., & Tarjan, R. E. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.0116
Self-citationOn the problem of finding all minimum spanning trees
Martinez, J., de Freitas, R., & da Silva, A. (2017) · Matemática Contemporânea · doi:10.21711/231766362017/rmc4511
Präntare, F. (2024) · Linköping studies in science and technology. Dissertations · doi:10.3384/9789180756013
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.