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,601–2,700 of 3,140
RNA Tree Comparisons via Unrooted Unordered Alignments
Milo, N., Zakov, S., Katzenelson, E., Bachmat, E., Dinitz, Y., & Ziv-Ukelson, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33122-0_11
On simulating the resilience of military hub and spoke networks
Bryce, R. M., Pall, R., & Ghanmi, A. (2013) · Winter Simulation Conference · doi:10.5555/2675983.2676342
Long cycles in certain graphs of large degree
Wong, P. (2000) · International Journal of Mathematics and Mathematical Sciences · doi:10.1155/s0161171200003653
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane
Grüne, A., Lin, T.-C., Yu, T.-K., Klein, R., Langetepe, E., Lee, D. T., & Poon, S.-H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17514-5_11
A rearrangement step with potential uses in priority queuesPreprint
Alexeev, B., & Jacokes, M. B. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1203.0259
Finding multiple routing paths in wide-area WDM networks
Liang, W., & Shen, X. (2003) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1109/icppw.2002.1039731
Decremental Approximate-APSP in Directed Graphs
Bernstein, A. (2015) · Springer eBooks · doi:10.1007/978-3-642-27848-8_564-1
A COVERING PROJECTION FOR ROBOT NAVIGATION UNDER STRONG ANISOTROPY
ANGHINOLFI, A., COSTA, L., Ferri, M., & Viarani, E. (2010) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195910003414
USING CELLULAR GRAPH EMBEDDINGS IN SOLVING ALL PAIRS SHORTEST PATHS PROBLEMS' (Preliminary Version)
Frederickson, G. N. (1989)
SOFT NOGOOD STORE AS A HEURISTIC
Missine, A. (2010) · Summit (Simon Fraser University)
Computation and Application of 3D Strokes on Visible Structures in Direct Volume Rendering
Wiebel, A., Preis, P., Vos, F. M., & Hege, H. (2013)
Borie, R. B., & Wiegand, N. M. (2010)
Parameterized Searching with Mismatches for Run-Length Encoded Strings
Apostolico, A., Erdős, P. L., & Jüttner, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16321-0_38
Distributed Coordination: Collecting, Locking, and Matching
Wattenhofer, M. (2006) · ETH Zürich Research Collection · doi:10.3929/ethz-a-005294235
An Algorithm for M Shortest Routes for a Net
Kalari, S. R. V., & Hasan, M. M. (2005) · International Conference on VLSI Design · doi:10.1109/icvd.1992.658057
A divide and conquer approach to shortest paths in planar layered digraphs
Sairam, S., Tamassia, R., & Vitter, J. S. (2003) · IEEE Symposium on Parallel and Distributed Processing (SPDP) · doi:10.1109/spdp.1992.242747
Sargut, Z., & Ahuja, R. K. (2011) · Wiley eBooks · doi:10.1002/9780470400531.eorms0509
A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
Takazawa, K. (2008) · Springer eBooks · doi:10.1007/978-3-540-68891-4_5
Spatio-termporal reasoning about agent behavior
Shakarian, P. (2011) · University Libraries (University of Maryland)
Source-waiting QoS routing in networks with advanced resource reservations
Xue, G., Li, G., Chen, G., & Chu, X. (2002) · International Conference on Communications · doi:10.1109/icc.2001.937013
Caminhos mínimos com recursos limitados
Uchoa, J. S. (2012) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.45.2012.tde-14012013-165742
Decision procedures for the temporal verification of concurrent data structures
Sánchez, A. (2011) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
Distributed algorithms for the constrained quickest routing problem in multimedia communications
Hung, Y. (2002) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.1998.998796
An efficient parallel algorithm for the assignment problem on the plane
Osiakwan, C. N. K., & Akl, S. G. (2003) · International Conference on Computing and Information (ICCI) · doi:10.1109/icci.1992.227693
The Iterative Minimum Cost Spanning Tree Problem
Bekius, F. (2013)
Efficient Shortest Path Algorithms By Graph Decompostion
Abuaiadh, D., & Kingston, J. H. (2006)
García-Marco, I. (2013) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
The Vital Core Connectivity Problem
Boyd, S. C., & Cameron, A. (2012)
Sahni, S. K. (2018) · doi:10.1201/9781315119335-8
Shortest Path Algorithms with Integer Edge Costs
Shinn, T.-W. (2002) · UC Research Repository (University of Canterbury) · doi:10.26021/2726
ILISTIC COMMUNICATION COMPLEXITY
Paturi, R., & Šimon, J. (1984)
Electronic Lecture Notes DATA STRUCTURES AND ALGORITHMS
Narahari, Y. (2000)
Fibonacci Heaps with Applications to Parallel Computation
Driscoll, J. R., Gabow, H. N., Shrairman, R., & Tarjan, R. E. (1988)
Self-citationEnhanced web-based summary generation for search.
Wenerstrom, B. (2012) · ThinkIR: The University of Louisville's Institutional Repository (University of Louisville) · doi:10.18297/etd/1547
Alberi di supporto e arborescenze
Körte, B., & Vygen, J. (2011) · Unitext · doi:10.1007/978-88-470-1523-4_6
Optimization for advanced lithography
Du, Y. (2014) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Finding Achievable Region among Line-segment Obstacles in the PlanePreprint
Wang, Z. J., & Yao, B. (2012) · arXiv (Cornell University)
Chen, D., Hsu, C. C., & Guo, C. F. (2015) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.764-765.886
Efficient sequential and parallel versions of MST-solvers for multi-core CPU-chips and GPUs
Sousa, C. D. S. (2014) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)
Locality optimizations on irregular algorithms and data structures
Faria, N. (2011) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)
Single Source Shortest Paths for All Flows with Integer Costs
Takaoka, T. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.atmos.2015.56
Layered Heaps Beating Standard and Fibonacci Heaps in PracticePreprint
Huggins, P. M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.03367
D13.3 Overall assessment of selected techniques on energy- and bandwidth-efficient communications
Zalonis, A., Polydoros, A., Dagres, I., López, J. R., Gregori, M., Pascual‐Iserte, A., Payaró, M., Viladerbó, J. G., Kieffer, M., Bassi, F., et al. (2015) · UPCommons institutional repository (Universitat Politècnica de Catalunya)
Algorithmic studies on online knapsack and related problems
河瀬, 康., & Kawase, Y. (2014) · Institutional Repositories DataBase (IRDB) · doi:10.15083/00007168
Improved Shortest Path Algorithms by Dynamic Graph Decomposition
Tian, L. (2006) · UC Research Repository (University of Canterbury) · doi:10.26021/2949
A Phase I That Solves Transportation Problems
Paparrizos, K. (1992) · Springer eBooks · doi:10.1007/978-3-642-77489-8_31
Study on performance efficient trees for multicast communication
Yong, K. K. M. (2009) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/20611
Modelos e algoritmos de cabeamento de redes telefonicas
Ferber, D. F. (2007) · doi:10.47749/t/unicamp.2007.410168
Algorithmic Foundations of Heuristic Search using Higher-Order Polygon Inequalities
Campbell, N. H. (2016) · NSUWorks (Nova Southeastern University)
Analysis of the subsequence composition of biosequences
Apostolico, A., & Cunial, F. (2012) · SMARTech Repository (Georgia Institute of Technology)
Chen, W. (2010) · NCSU Libraries Repository (North Carolina State University Libraries)
Adaptive Abstraction for Model-Based Reinforcement Learning
Kochenderfer, M. J. (2006)
Navigating Weighted Regions with Scattered Skinny Tetrahedra
Cheng, S.-W., Chiu, M.-K., Jin, J., & Vigneron, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48971-0_4
Coping with Selfish Behavior in Networks using Game Theory
Yang, D. (2013)
Optimal display sequence for multi-clip queries
Shum, P. S. L. (2009) · Open Collections · doi:10.14288/1.0051463
HASEGAWA, T., Ito, T., Suzuki, A., & Zhou, X. (2015) · Interdisciplinary Information Sciences · doi:10.4036/iis.2015.25
Shortest Path Tree with Embedded Backups-an Exhaustive Link Failure Recovery Algorithm
Qureshi, M. A., Hassan, M. F., Sammi, R., Safdar, S., & Akbar, R. (2011) · Journal of Artificial Intelligence · doi:10.3923/jai.2011.143.155
A comprehensive theory of cascading via-paths and the reciprocal pointer chain methodPreprint
Smock, B., & Wilson, J. N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.09205
Efficient query processing on large graphs
Zhu, D. (2014) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/61838
Optimizing protein importance assessment through a Dijkstra-based sequential optimization technique
Bocu, R., & Bocu, D. (2011)
Best first search and document processing applications
Jones, P. A. (2000) · Radboud Repository (Radboud University)
REVUE FRANÇAISE D'AUTOMATIQUE, D'INFORMATIQUE ET DE
Opérationnelle, R., Atallah, M., Ribeiro, C. C., & Lifschitz, S. (1985)
Faculty of Mathematics and Information Science
Mesjasz, M. M. (2013)
Hybrid Evolutionary Routing Optimisation for Wireless Sensor Mesh Networks
Rahat, A. (2015) · Figshare
Augmenting weighted graphs to establish directed point-to-point connectivity
Roayaei, M., & Razzazi, M. (2016) · Journal of Combinatorial Optimization · doi:10.1007/s10878-016-0023-y
Algebraic Theory on Shortest Paths for All Flows
Takaoka, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26626-8_55
Cyclic level drawings of directed graphs
Brunner, W. (2010) · OPUS (University of Passau)
SONIK: Efficient In-Situ All Item Rank Generation Using Bit Operations
(2016) · International Workshop on Computer Science and Engineering (WCSE) · doi:10.18178/wcse.2016.06.106
Binomial, Fibonacci, and Pairing Heaps
Fredman, M. L. (2018) · doi:10.1201/9781315119335-7
Self-citationApproximating the Restricted 1-Center in Graphs
Ding, W., & Qiu, K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26626-8_47
Drawing Dynamic Graphs by Stress Minimization
Mader, M. (2014) · KOPS (University of Konstanz)
Shortest Path in Transportation Network and Weighted Subdivisions
Elshawi, R., & Gudmundsson, J. (2011) · Advances in data mining and database management book series · doi:10.4018/978-1-61350-053-8.ch020
Gestion des Grandes Masses de Données dans les Graphes Réels
Dhia, I. B., Abdessalem, T., Sozio, M., & Cédric, M. (2013)
Forwarding on Gates : A flexible and scalable inter-network layer supporting in-network functions
Liers, F. (2014) · Common Library Network (Der Gemeinsame Bibliotheksverbund)
Fast Parallel Algorithms for Basic Problems
Wen, Z. (1991) · ODU Digital Commons (Old Dominion University) · doi:10.25777/9m63-1989
Optimisation of large scale network problems
Grigoleit, M. T. (2008) · eSpace (Curtin University)
Using Discrete and Continuous Models to Solve Nanoporous Flow Optimization Problems
Boggs, P. T., Gay, D. M., & Nash, S. G. (2015) · Numerical Mathematics Theory Methods and Applications · doi:10.4208/nmtma.2015.w13si
Borcea, C. (2015) · Chapman & Hall/CRC eBooks · doi:10.1201/b18001-26
Multipartite graph clustering for structured datasets and automating ortholog extraction
Kulikowski, C. A., & Vashist, A. (2006)
Heydari, R. (2015) · Digital Repository Service (Northeastern University) · doi:10.17760/d20194592
Měření významnosti autorů v citační síti
Maršálek, T. (2013) · Digital Library (University of West Bohemia)
A Comprehensive Reachability Evaluation for Airline Networks with Multi-constraints
You, X., Gao, X., Dang, Y., Chen, G., & Wang, X. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-48749-6_3
Computations to Obtain Wider Tunnels in Protein Structures
Zangooei, S. (2011) · UWSpace (University of Waterloo)
Using translational score maps to aid MT evaluation
Harris, C. G., & Li, Z. (2011) · International Conference on Natural Language Processing and Knowledge Engineering (NLPKE) · doi:10.1109/nlpke.2011.6138163
Lim, A. E. B., & Sahni, S. K. (1992) · ACM Southeast Regional Conference (ACMSE) · doi:10.1145/503782.503783
Pruned Labeling Algorithms : Unified Indexing Scheme for Graph Query Processing
秋葉, 拓. (2015) · Institutional Repositories DataBase (IRDB) · doi:10.15083/00008552
Linear Space All-Pairs Shortest-Paths Computation on Road Networks
Sasse, J.-O. (2010)
ON THE SHORTEST PATH AND THE MINIMUM SPANNING TREE PROBLEMS
Thesis, A., & Ramesh, T. K. (2009)
Routing and Disaster Awareness in Optical Networks
Muhammad Iqbal, M. A. F. (2016) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:64cd0a44-acc7-49bc-905a-017c4855511a
Gliesch, A. (2015) · Lume (Universidade Federal do Rio Grande do Sul)
The Latest Progress of Generalized Flow Problems
Nakayama, A. (2004) · 行政社会論集
Using Rewards to Motivate Present-Biased Agents
Heimann, M. (2015) · Open Scholarship Institutional Repository (Washington University in St. Louis)
Application of GPU Computing to Some Urban Traffic Problems
Jradi, W. A. R. (2016) · Americanae (AECID Library)
Analysis of the optimization railway route from Romania to Poland in “one belt and one road”
Chen, W., & Lu, X. (2016) · International Conference on Logistics, Informatics and Service Sciences · doi:10.1109/liss.2016.7854584
Asynchronous Algorithms for Shared Memory Machines
Wu, M. M. (1991) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
Workforce scheduling and planning:a combinatorial approach
Fırat, M. (2012) · TU/e Research Portal · doi:10.6100/ir731238
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.