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 1,801–1,900 of 3,140
Shortest paths in synchronized traffic-light networks
Khanjary, M., Karim Faez, A., Meybodi, M. R., & Sabaei, M. (2011) · Conference proceedings - Canadian Conference on Electrical and Computer Engineering · doi:10.1109/ccece.2011.6030584 · Cited by 4
A faster strongly polynomial time algorithm to solve the minimum cost tension problem
Ghiyasvand, M. (2016) · Journal of Combinatorial Optimization · doi:10.1007/s10878-016-0070-4 · Cited by 4
Toward Optimal Self-Adjusting Heaps
Elmasry, A. (2017) · ACM Transactions on Algorithms · doi:10.1145/3147138 · Cited by 4
A note on the 2-circulant inequalities for the max-cut problem
Kaparis, K., & Letchford, A. N. (2018) · Operations Research Letters · doi:10.1016/j.orl.2018.05.006 · Cited by 4
Wang, Y., Ali, M., Wang, Y., Kucenas, S., & Yu, G. (2018) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2018.8363730 · Cited by 4
Timmons, E., & Williams, B. C. (2020) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11892 · Cited by 4
Kamal-Idrissi, A., Malapert, A., & Jolin, R. (2019) · International Conference on Operations Research and Enterprise Systems · doi:10.5220/0007388500002104 · Cited by 4
Scalable explicit path control in software-defined networks
Luo, L., Yu, H., Luo, S., Ye, Z., Du, X., & Guizani, M. (2019) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2019.05.014 · Cited by 4
Practical Applicability of Advanced Implementations of Priority Queues in Finding Shortest Paths
Mrena, M., Sedlaček, P., & Kvaššay, M. (2019) · International Conference on Information and Digital Technologies (IDT) · doi:10.1109/dt.2019.8813457 · Cited by 4
Letchford, A. N., & Vu, A. N. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01430-y · Cited by 4
Notice of Removal: Reinforcement Learning and Additional Rewardsfor the Traveling Salesman Problem
Mele, U. J., Chou, X., Gambardella, L. M., & Montemanni, R. (2020) · IEEE International Conference on Industrial Engineering and Applications (ICIEA) · doi:10.1109/iciea49774.2020.9101981 · Cited by 4
A Parameterized Family of Meta-Submodular Functions
Ghadiri, M., Santiago, R., & Shepherd, F. B. (2024) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977912.51 · Cited by 4
The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network
Lu, K., Tang, T., & Gao, C. (2020) · Sustainability · doi:10.3390/su12135365 · Cited by 4
Ganapathy, J., & Márquez, F. P. G. (2021) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-030-79203-9_43 · Cited by 4
An efficient multiple scanning order algorithm for accumulative least-cost surface calculation
Yao, Y., Shi, X., & Wang, Z. (2022) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2022.2052885 · Cited by 4
AlFanatseh, A., & Sababhi, S. (2022) · GeoJournal · doi:10.1007/s10708-022-10632-5 · Cited by 4
A novel pseudo‐polynomial approach for shortest path problems
Danilović, M., Vasiljević, D., & Cvetić, B. (2021) · Networks · doi:10.1002/net.22027 · Cited by 4
Some graph optimization problems with weights satisfying linear constraints
Nip, K., Shi, T., & Wang, Z. (2021) · Journal of Combinatorial Optimization · doi:10.1007/s10878-021-00754-w · Cited by 4
Routing Vehicles on Highways by Augmenting Traffic Flow Network: A Review on Speed Up Techniques
Ganapathy, J., Márquez, F. P. G., & Prasad, M. R. (2022) · Smart innovation, systems and technologies · doi:10.1007/978-3-030-92905-3_11 · Cited by 4
Delay-constrained minimum shortest path trees and related problems
Lichen, J., Cai, L., Li, J., Liu, S., Pan, P., & Wang, W. (2022) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.11.014 · Cited by 4
Stoop, K., Pickavet, M., Colle, D., & Audenaert, P. (2023) · International Journal of Shipping and Transport Logistics · doi:10.1504/ijstl.2023.134745 · Cited by 4
Finding SRLG-Disjoint Primary and Backup Route Pairs using k-SPF algorithm in Optical Networks
Matsuura, H., Koshiji, K., Yokoi, H., Matsukawa, T., & Fujii, T. (2023) · Globecom · doi:10.1109/globecom54140.2023.10436808 · Cited by 4
Combinatorics in computer science
Lovász, L., Shmoys, D. B., & Eva Tardos, D. (1996) · The MIT Press eBooks · Cited by 4
Reducing the Complexity of Robot's Scene for Faster Collision Detection
Nearchou, A. C., Aspragathos, N., & Sofotassios, D. (1999) · Journal of Intelligent & Robotic Systems · doi:10.1023/a:1008190406456 · Cited by 4
DÉJÀ VU: An Entropy Reduced Hash Function for VLSI Layout Databases
Koranne, S. (2015) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2015.2432132 · Cited by 4
Four-layer framework for combinatorial optimization problems domain
Levin, M. S. (2011) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2011.07.013 · Cited by 4
Graph and matrix metrics to analyze ergodic literature for children
Kontopoulou, E.-M., Predari, M., Kostakis, T., & Gallopoulos, E. (2012) · ACM Conference on Hypertext and Social Media (HT) · doi:10.1145/2309996.2310018 · Cited by 4
Optimizing customized services: efficient computation in large Service Value Networks
Haak, S., & Weinhardt, C. (2013) · Information Systems and e-Business Management · doi:10.1007/s10257-013-0218-z · Cited by 4
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Cantone, D. A., & Faro, S. (2013) · Journal of Discrete Algorithms · doi:10.1016/j.jda.2013.03.005 · Cited by 4
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Letchford, A. N., & Pearson, N. A. (2005) · Operations Research Letters · doi:10.1016/j.orl.2004.12.001 · Cited by 4
Ensemble motion planning in trees
Frederickson, G. N., & Guan, D. J. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63457 · Cited by 4
Path selection in user-controlled circuit-switched optical networks
Golab, W., & Boutaba, R. (2008) · Optical Switching and Networking · doi:10.1016/j.osn.2008.02.001 · Cited by 4
A Branch-Checking Algorithm for All-Pairs Shortest Paths
Duin, C. W. (2004) · Algorithmica · doi:10.1007/s00453-004-1122-1 · Cited by 4
Improvement of a Shortest Routes Algorithm
Lassabe, N., Berro, A., & Duthen, Y. (2007) · IEEE International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2007.4357802 · Cited by 4
The effect of post-layout pin permutation on timing
Ding, Y., Suaris, P., & Chou, N.-C. (2005) · ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) · doi:10.1145/1046192.1046199 · Cited by 4
Euclidean Shortest Paths on Polyhedra in Three Dimensions
Sackler, B. (2007) · Cited by 4
Computing and Listing st-Paths in Public Transportation Networks
Böhmová, K., Mihaľák, M., Pröger, T., Sacomoto, G., & Sagot, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-34171-2_8 · Cited by 4
MUSE: A parallel Agent-based Simulation Environment
Gebre, M. R. (2009) · OhioLink ETD Center (Ohio Library and Information Network) · Cited by 4
Predictive log-synchronization
Shalev, O., & Shavit, N. (2006) · ACM SIGOPS Operating Systems Review · doi:10.1145/1218063.1217965 · Cited by 4
Hansen, T. D., Kaplan, H. Y., Tarjan, R. E., & Zwick, U. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47672-7_56 · Cited by 4
Self-citationRouting Architecture for the Dependable Internet
Ohara, Y. (2008) · Cited by 4
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
Friedrich, T., & Hebbinghaus, N. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92182-0_61 · Cited by 4
Splitting a configuration in a simplex
Numata, K., & Tokuyama, T. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52921-7_92 · Cited by 4
On the spanning trees of weighted graphs
Mayr, E. W., & Plaxton, C. G. (1989) · Lecture notes in computer science · doi:10.1007/3-540-50728-0_58 · Cited by 4
The quickest path problem in distributed computing systems
Hung, Y., & Chen, G.-H. (2005) · Springer eBooks · doi:10.1007/bfb0022446 · Cited by 4
Maintaining Longest Paths in Cyclic Graphs
Katriel, I., & Hentenryck, P. V. (2005) · Lecture notes in computer science · doi:10.1007/11564751_28 · Cited by 4
Quasi-Concave Functions and Greedy Algorithms
Kempner, Y., Vadim, E., & Muchnik, I. B. (2008) · InTech eBooks · doi:10.5772/6340 · Cited by 4
Path problems in skew-symmetric graphs
Goldberg, A. V., & Karzanov, A. V. (1994) · Symposium on Discrete Algorithms · doi:10.5555/314464.314640 · Cited by 4
The first K shortest unique-arc walks in a traffic-light network
Yang, H., & Chen, Y. (2004) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2005.01.004 · Cited by 4
A generic topology discovery approach for huge social networks
Krishna, P. R., Indukuri, K. V., & Syed, S. (2012) · Bangalore Annual Compute Conference · doi:10.1145/2459118.2459123 · Cited by 4
Car-Pooling as a Data Structuring Device: The Soft Heap
Chazelle, B. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68530-8_3 · Cited by 4
The Steiner tree problem with minimum number of vertices in graphs
Makki, K., & Pissinou, N. (2003) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1109/glsv.1992.218344 · Cited by 4
A New Implementation of Dijkstra's Algorithm on Urban Rail Transit Network
Tang, J., Sun, Q., & Chen, Z. (2016) · International Conference on Civil, Transportation and Environment (ICCTE) · doi:10.2991/iccte-16.2016.85 · Cited by 4
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
Ding, W., & Qiu, K. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.02.007 · Cited by 4
Accelerating Dijkstra's Algorithm Using Multiresolution Priority Queues
Ros-Giralt, J., Commike, A., Cullen, P. B., & Lethin, R. (2018) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2018.8547539 · Cited by 4
SIVA: A Low Complexity and Optimum Decoding Algorithm for Tail-Biting Codes
Karimzadeh, M., & Vu, M. H. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3071379 · Cited by 4
Heng, P., Fung, P. W., Leung, K., Sun, H., & Wong, T. (2000) · International Journal of Virtual Reality · doi:10.20870/ijvr.2000.4.4.2654 · Cited by 4
Safe, Scalable, and Complete Motion Planning of Large Teams of Interchangeable Robots
Turpin, M. (2014) · ScholarlyCommons (University of Pennsylvania) · Cited by 4
Zamani, M. R. (1995) · Research Online (University of Wollongong) · Cited by 4
Traversing large graphs in realistic settings
Ajwani, D. (2008) · Max Planck Institute for Plasma Physics · doi:10.22028/d291-25941 · Cited by 4
Fuzzy non-iterative ARG labeling with multiple interpretations
Shao, Z., & Kittler, J. (1996) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1996.546748 · Cited by 4
A new storage organization for temporal data bases
Makki, K., & Pissinou, N. (1994) · Journal of Systems and Software · doi:10.1016/0164-1212(94)90039-6 · Cited by 4
Nemani, A. K., & Ahuja, R. K. (2011) · Wiley eBooks · doi:10.1002/9780470400531.eorms0816 · Cited by 4
Shedding new light on random trees
Broutin, N. (2007) · eScholarship@McGill (McGill) · doi:10.82308/28950 · Cited by 4
Approximation algorithms for linear programs and geometrically constrained packing roblems
Diedrich, F. (2009) · Multimedialen Archiv und Publikationsserver der Christian-Albrechts-Universität zu Kiel (Christian-Albrechts-Universität zu Kiel) · Cited by 4
Fast Collision-Free Path Planning for Translating Mobiler in Three-Dimensional Space.
Shibata, M., Murakami, T., & Ohnishi, K. (1995) · Journal of the Japan Society for Precision Engineering · doi:10.2493/jjspe.61.1545 · Cited by 4
A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite GraphsPreprint
Дас, Ш. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.00406 · Cited by 4
The robust shortest path problem with discrete data
Resende, M. (2015) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · Cited by 4
HIERARCHICAL OFF-ROAD PATH PLANNING AND ITS VALIDATION USING A SCALED AUTONOMOUS CAR
Goswami, A. (2017) · TigerPrints (Clemson University) · doi:10.13140/rg.2.2.28423.50084 · Cited by 4
Scalable Parameterised Algorithms for two Steiner Problems
Muniyappa, S. (2017) · Aaltodoc (Aalto University) · Cited by 4
Chaotic Neural Circuit Dynamics
Engelken, R. (2018) · eDiss (Georg-August-Universität Göttingen) · doi:10.53846/goediss-6718 · Cited by 4
Parallelization of Morphological Operators Based on Graphs
Youkana, I. (2017) · University of Biskra Theses Repository (University of Biskra) · Cited by 4
Ramachandran, V., & Hentenryck, P. V. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60360-3_48 · Cited by 4
More Parallelism in Dijkstra's Single-Source Shortest Path AlgorithmPreprint
Kainer, M., & Träff, J. L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.12085 · Cited by 4
Revisiting the Auction Algorithm for Weighted Bipartite Perfect MatchingsPreprint
Khosla, M., & Anand, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.07155 · Cited by 4
Bipartite Graph Matching Algorithms for Clean-Clean Entity Resolution: An Empirical EvaluationPreprint
Papadakis, G., Efthymiou, V., Thanos, E., & Hassanzadeh, O. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.14030 · Cited by 4
Samra, R. Z. A., & Salameh, H. B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.04971 · Cited by 4
Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ timePreprint
Holm, J., Nadara, W., Rotenberg, E., & Sokołowski, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2503.21733 · Cited by 4
On Solving Constrained Tree Problems and an Adaptive Layers Framework
Ruthmair, M. (2012) · reposiTUm (TU Wien) · doi:10.13140/rg.2.2.10206.54080 · Cited by 4
Fontaine, R. (2024) · theses.fr (ABES) · doi:10.70675/09043c22zfaa5z4e3bz868bz8ac1958d96f3 · Cited by 4
Automatic Reconstruction of Emperor Itineraries from the Regesta Imperii
Opitz, J., Born, L., Năstase, V., & Pultar, Y. (2019) · International Conference on Digital Access to Textual Cultural Heritage (DATeCH) · doi:10.1145/3322905.3322921 · Cited by 3
Floyd–Warshall Algorithm for Sparse Graphs
Zugan, D., Požar, R., & Brodnik, A. (2025) · Algorithms · doi:10.3390/a18120766 · Cited by 3
Multimodal Pathfinding with Personalized Travel Speed and Transfers of Unlimited Distance
Rohovyi, A., Stuckey, P. J., & Walsh, T. (2025) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai66417.2025.00135 · Cited by 3
Evaluating Personal Driving Risk and Road Safety in the Context of Road Navigation
Zhang, T., Zou, Y., Chen, Y., Xie, Y., & Wang, Y. (2026) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2026.3652272 · Cited by 3
A grand-canonical solution to a class of random optimization problems
Baybusinov, I. B., Fenoaltea, E. M., Han, Z., & Zhang, Y. (2026) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2026.118012 · Cited by 3
BBC: Improving Large- k Approximate Nearest Neighbor Search with a Bucket-Based Result Collector
Yin, Z., Cong, G., Zeng, K., Zhu, J., & Cui, B. (2026) · Proceedings of the VLDB Endowment · doi:10.14778/3836663.3836702 · Cited by 3
Lahn, N., & Raghvendra, S. (2019) · Journal of computational geometry · doi:10.20382/jocg.v11i2a8 · Cited by 3
Algorithms for Finding Vulnerabilities and Deploying Additional Sensors in a Region with Obstacles
Kim, K., & Lee, S. (2021) · Electronics · doi:10.3390/electronics10121504 · Cited by 3
The parameterized complexity of finding minimum bounded chains
Blaser, N., Brun, M., Salbu, L. M., & Vågset, E. R. (2024) · Computational Geometry · doi:10.1016/j.comgeo.2024.102102 · Cited by 3
Dijkstra’s Algorithm-A Case Study to Understand How Algorithms are improved
Qureshi, M. A. (2021) · VFAST Transactions on Software Engineering · doi:10.21015/vtse.v9i3.706 · Cited by 3
Evacuation Simulation for Large-Scale Urban Population
Harari, E., Abudarham, N., & Rokita, T. (2023) · Springer proceedings in complexity · doi:10.1007/978-3-031-34920-1_10 · Cited by 3
Kostenko, V., & Golubcov, V. (2023) · Bulletin of scientific research results · doi:10.20295/2223-9987-2023-4-158-172 · Cited by 3
Faster MIL-based Subgoal Identification for Reinforcement Learning by Tuning Fewer Hyperparameters
Sunel, S., Çіlden, E., & Polat, F. (2024) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/3643852 · Cited by 3
Pareto Optimal Solutions of the Biobjective Minimum Length Minimum Risk Spanning Trees Problem
Laskov, L. M., & Marinov, M. L. (2024) · Annals of Computer Science and Information Systems · doi:10.15439/2024f2913 · Cited by 3
Luo, Y. C., Chen, B. Y., Zhang, Y., Li, W., Gong, J., & Li, Q. (2024) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2024.2431906 · Cited by 3
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Pagh, R., Retschmeier, L., Wu, H., & Zhang, H. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3725240 · Cited by 3
On a Notion of Graph Centrality Based on L 1 Data Depth
Kang, S., & Oh, H. (2025) · Journal of the American Statistical Association · doi:10.1080/01621459.2025.2520467 · Cited by 3
Beyond Shortest Paths: Node Fairness in Route Recommendation
Ferrara, A., García-Soriano, D., & Bonchi, F. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3746405.3746440 · Cited by 3
Off road transportation cost calculations for ground based forest harvesting systems
Søvde, N. E. (2014) · Mathematical and Computational Forestry & Natural-Resource Sciences (MCFNS) · Cited by 3
Classification and Traversal Algorithmic Techniques for Optimization Problems on Directed Hyperpaths
Ausiello, G., Italiano, G. F., Laura, L., Nanni, U., & Sarracco, F. (2010) · Cited by 3
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.