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,701–2,800 of 3,140
McClurg, J. (2014) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Sezgin, I. C. (2017) · Nomos Verlagsgesellschaft mbH & Co. KG eBooks · doi:10.5771/9783845281759-123
Niemeyer, K. E. (2014) · OhioLink ETD Center (Ohio Library and Information Network)
Approximation Algorithms for Network Connectivity Problems
Cameron, A. (2012) · uO Research (University of Ottawa) · doi:10.20381/ruor-5633
Optimisation for Large-scale Maintenance, Scheduling and Vehicle Routing Problems
Chen, Y. (2017) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)
Data-driven pedestrian simulation
Zhao, M. (2017) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/69836
Robust Path Planning: Models and Algorithms
Senatore, M. (2014) · IRIS Research product catalog (Sapienza University of Rome)
Techniques for Building Highly Concurrent Data Structures
Shalev, O. (2007)
Araújo, B. (2015) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.55.2015.tde-16122015-151236
All-Pairs Shortest Alternate Paths
Das, B. (1996) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
The Logarithmic Funnel Heap: A Statistically Self-Similar Priority QueuePreprint
Loeffeld, C. (2017) · arXiv (Cornell University)
A gentle introduction to matroid algorithmics
Stallmann, M. F. M. (2016) · NCSU Libraries Repository (North Carolina State University Libraries)
Approximation and online algorithms for selected network optimization problems
Ochel, M., & Vöcking, B. (2013) · RWTH Publications (RWTH Aachen)
Study Morphology of Minimum Spanning Tree Problem and Generalized AlgorithmsPreprint
Tan, Y. K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.07708
A stochastic approach to modeling surface wildfire propagation
Hajian, M. (2016) · Digital Repository Service (Northeastern University) · doi:10.17760/d20211470
Building Blocks for Mapping Services
Luxen, D. (2013) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000035705
Development of an OpenFlow controller application for enhanced path computation
dos Santos, R. R. (2015) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)
Evolução da componente algorítmica de cálculo de rotas do Move-Me
Pinheiro, A. P. D. (2017) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · doi:10.34626/h1y7-bs22
Reducing the risk of failure in interdependent national infrastructure network systems
Thacker, S. (2015) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-n6vm0ddkn
An Epsilon-Approximation Scheme for Minimum Variance Combinatorial Problems
Katoh, N. (1987) · IIASA PURE (International Institute of Applied Systems Analysis)
Graphical algorithms for some network flow problems and some results on hamiltonicity problems
Shaw, H.-M. (1992) · OhioLink ETD Center (Ohio Library and Information Network)
Cache Optimization for the Modern Web
Lam, J. (2015) · eScholarship (California Digital Library)
Потапов Д.Р., А. М. А., М.А., А., Е.С., Б., & К.Е., С. (2017) · Кибернетика и программирование · doi:10.25136/2306-4196.2017.5.23557
Transit data-based MST computation
Karatasos, T., & Papaioannou, E. (2017) · Electronic Journal of Graph Theory and Applications · doi:10.5614/ejgta.2017.5.2.6
Algorithms for interactive, distributed and networked systems
Venkatakrishnan, S. B. (2017) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Scheduling under uncertainty: Attaining flexibility, robustness and stability
Mountakis, K. S. (2018) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:4e63aefa-04cf-4a63-a5b0-e48d6e227390
GRAPE: Parallel Graph Query Engine
Xu, J. (2017) · ERA
DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
Jane, C., & Laih, Y. (2018) · Probability in the Engineering and Informational Sciences · doi:10.1017/s026996481700047x
An Approximation Algorithm for Incrementally Deploying SDN Forwarding Devices
Zhang, X., & Suppakitpaisarn, V. (2018) · International Conference on Ubiquitous Information Management and Communication (IMCOM) · doi:10.1145/3164541.3164600
COSMO - Using error to optimize the city
Fernandes, G. N. V. (2013) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)
FlexQueue: Simple and Efficient Priority Queue for System Software
Zhang, Y. (2018) · UWSpace (University of Waterloo)
Cascade Heap: Towards Time-Optimal Extractions
Babenko, M. A., Kolesnichenko, I., & Smirnov, I. (2018) · Theory of Computing Systems · doi:10.1007/s00224-018-9866-1
Bush, J. A. (2018) · eScholarship (California Digital Library)
Finding Efficient Region in The Plane with Line segmentsPreprint
Wang, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.7638
Shortest Paths in Geometric Intersection Graphs
Skrepetos, D. (2018) · UWSpace (University of Waterloo)
Making Project Team Recommendations from Online Information Sources
Earl, C., Johnson, A. Y., Yelpaala, K., & Good, T. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v5i1.14083
Ghiyasvand, M. (2018) · Journal of Combinatorial Optimization · doi:10.1007/s10878-018-0331-5
Parameterized Algorithms for GraphPartitioning Problems
Kare, A. S., & Kalyanasundaram, S. (2018) · Research Archive of Indian Institute of Technology Hyderabad (Indian Institute of Technology Hyderabad)
Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems.Preprint
Filtser, A., Krauthgamer, R., & Trabelsi, O. (2018) · arXiv (Cornell University)
Segmentation of brain x-ray CT images using seeded region growing
Bub, A. M. (1996) · Open University of Cape Town (University of Cape Town)
Un nouveau descripteur iconique topologique pour l'appariement d'images de structures anatomiques
Piché, N. (2017) · PolyPublie (École Polytechnique de Montréal)
Implementing Reliable Traffic Prediction in Mobile Crowd Devices
Bency, M. A. (2017) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.21572007
Towards a Framework for Multiscale Social Event Extraction and Visualization
Rehman, F. U. (2018) · theses.fr (ABES) · doi:10.70675/51a0c729z6791z4776z818cz363434734c7e
Adatgráfok alkalmazásai területei
Rácz, G. (2018) · Eötvös Loránd Tudományegyetem · doi:10.15476/elte.2017.129
A Scalable Parallel Algorithm for the Simulation of Structural Plasticity in the Brain
Rinke, S. (2018) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00007756
Localización simple de servicios deseados y no deseados en redes con múltiples criterios
Santamaría, C., & Alejandro, M. (2003) · Scientia Insularum Revista de Ciencias Naturales en islas
DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION
Andersen, P. (2019) · Bulletin of the Australian Mathematical Society · doi:10.1017/s0004972719001126
Finding optimal paths on dynamic road networks
Guyard, A. B. (2008)
Breaking the Bellman-Ford Shortest-Path BoundPreprint
Elmasry, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.01325
Distributed services across the network from edge to core
Sapio, A. (2018) · PORTO@Iris · doi:10.6092/polito/porto/2706995
Multicasting in generalized class networks
Lane, C. M. (1996) · Digital Scholarship - UNLV (University of Nevada Reno) · doi:10.25669/eii2-q251
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and AlgorithmsPreprint
Avraham, R. B., Henze, M., Jaume, R., Keszegh, B., Raz, O. E., Sharir, M., & Tubis, I. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.7273
Worst-Case Optimal Priority Queues via Extended Regular CountersPreprint
Elmasry, A., & Katajainen, J. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.0993
Euclidean TSP with few inner points in linear spacePreprint
Gawrychowski, P., & Rusak, D. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.2154
A Faster Algorithm for Solving One-Clock Priced Timed GamesPreprint
Hansen, T. D., Ibsen-Jensen, R., & Miltersen, P. B. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1201.3498
Speeding up shortest path algorithmsPreprint
Brodnik, A., & Grgurovič, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.6327
Analysis, Modeling, and Control of Dynamic Processes in Networks
Amelkin, V. (2018) · eScholarship (California Digital Library)
Application of nearest neighbour search techniques to peptide identification from mass spectrometry
Ulate-Cárdenas, J. D. J. (2018) · Americanae (AECID Library)
On the Universal Near Shortest Simple Paths ProblemPreprint
Schäfer, L. E., Maier, A., & Ruzika, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.05101
Schaefer, M. (2018) · CRC Press eBooks · doi:10.1201/9781315152394-4
The Online Replacement Path ProblemPreprint
Adjiashvili, D., & Senatore, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.5959
Bayesian Generalized Network Design
Emek, Y., Kutten, S., Lavi, R., & Shi, Y. (2019) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2019.45
On Variants of the Single-criterion and Multiobjective Near-Shortest Paths Problem
Schäfer, L. E., & Ruzika, S. (2019) · Springer eBooks · doi:10.1007/978-3-658-27041-4_2
Shortest Coverage Sequences for Covering Moving Targets in Networks
Fröhlich, N. (2019) · Springer eBooks · doi:10.1007/978-3-658-27041-4_3
Combining the Connection Scan Algorithm with Contraction HierarchiesPreprint
Turner, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.09041
Finding a shortest walk along a sequence of imprecise regions in a graph
Sheibani, N. (2019) · Mspace (University of Manitoba)
Geothermal pipeline route design with regard to visual impact
Leifsson, E. S. (2019) · Skemman
Primas, B. (2019) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)
Novel Parameter-less Hierarchical Algorithms for Image Segmentation and Data Clustering
Abdullah, S. M. (2019) · Figshare · doi:10.26180/5cf88cccd07c8
Approximate Euclidean Shortest Paths in Polygonal Domains
Inkulu, R., & Kapoor, S. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.isaac.2019.11
Optimal route planning for hitchhiking
Vedernikov, O. (2019) · Minerva Access (University of Melbourne)
Label Propagation of Polarity Lexica on Word Vectors.
Koppen, H., & Ritavan (2019) · KONVENS
Optimally Adhering to Behavioral Priors in Unknown Environments with RRTs
Evans, E. N., Meyer, P., Bays, M. J., Mavris, D. N., & Theodorou, E. A. (2020) · AIAA SciTech Forum · doi:10.2514/6.2020-0614
Biyela, P. (2017) · ResearchSpace (University of KwaZulu-Natal)
Discrete Geometric Path Analysis in Computational Geometry
Gheibi, A. (2016) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2016-11226
Adaptive Fibonacci and Pairing HeapsPreprint
Frohmader, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.03959
Optimisation algorithms for planning and scheduling workplace training
Czibula, O. G. (2017) · UTS ePRESS (University of Technology Sydney)
Koh, Z. K., Natura, B., & Végh, L. A. (2020) · arXiv (Cornell University)
Implementing Leader Election Algorithm after Evaluation of Node Trust in MANETs
Das, J., & Das, A. (2016) · Advances in wireless technologies and telecommunication book series · doi:10.4018/978-1-5225-1785-6.ch011
Two new algorithms for the linear assignment problem
Ekin, O. (1990) · Bilkent University Institutional Repository (Bilkent University)
Investigation of Matching Problems using Constraint Programming and Optimisation Methods
Chisca, D. S. (2020) · AMS Dottorato Institutional Doctoral Theses Repository (University of Bologna) · doi:10.6092/unibo/amsdottorato/9177
Modelování intenzity dopravy v paralelním výpočetním prostředí
Kolovský, F. (2017) · Digital Library (University of West Bohemia)
Open Data Structures (in Java)
Morin, P. (2018)
GRMR: Generalized Regret-Minimizing RepresentativesPreprint
Wang, Y., Mathioudakis, M., Li, Y., & Tan, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.09634
Retracted: A novel pseudo‐polynomial approach for shortest paths problems
Danilović, M., Vasiljević, D., & Cvetić, B. (2020) · Networks · doi:10.1002/net.21966
RetractedEmbedding Graphs for Shortest-Path Distance Predictions
Zhao, Z. (2020) · Minerva Access (University of Melbourne)
An Efficient Algorithm for Finding Sets of Optimal RoutesPreprint
Zoref, I., & Orda, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.10406
Improving Traffic Flow in the 21st Century: The Automated Road System
Kriadis, P. (2020) · Digital Access to Scholarship at Harvard (DASH) (Harvard University)
Adaptable Safe Path Planning Under Uncertainty Constraints
Jain, S. (2019) · UA Campus Repository (The University of Arizona)
Reliable service chain orchestration for scalable data-intensive computing at infrastructure edges
Chemodanov, D. (2019) · MOspace Institutional Repository (University of Missouri) · doi:10.32469/10355/76223
Prioriteettijonon toteuttaminen kekorajapinnan ehdolla Dijkstran algoritmissa
Hyvönen, S. (2014) · UEF eRepo (University of Eastern Finland)
Autonomous path planning using probabilistic maps
Frischenschlager, A. (2014) · reposiTUm (TU Wien) · doi:10.34726/hss.2014.25301
A BIGENERIC MULTI-PATH ROUTING ALGORITHM FOR WIRELESS MESH NETWORKS
Loret, J. B. S., & Kumar, R. G. (2017) · Media culture and public relations
Alternativa de cable aéreo en la ciudad de Manizales
Barco, A. (2020)
A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem
Ahuja, R. K., Kanpur, I. I., & Orlin, J. B. (1993) · Defense Technical Information Center (DTIC) · doi:10.21236/ada459686
Tunev, I. N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.09362
A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic MemoryPreprint
Haberland, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.01667
Optimisation des réseaux aériens: analyse et sélection de nouveaux marchés
Kamal-Idrissi, A. (2020) · Bulletin 1024 · doi:10.48556/sif.1024.16.136
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.