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,301–2,400 of 3,140
Information theoretic implications for pairing heaps
Fredman, M. L. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276779 · Cited by 1
Self-citationImprovement of Steiner Tree Algorithm: Branch-Based Multi-Cast
Matsuura, H. (2013) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e96.d.2743 · Cited by 1
Approximating Minimum k-partitions in Submodular Systems
Nagamochi, H. (2007) · International Conference on Informatics Education and Research for Knowledge-Circulating Society (ICKS) · doi:10.1109/icks.2007.3 · Cited by 1
GLIDING STRATEGY DESIGN WITH THE USE OF DISCRETE OPTIMIZATION
Kowalczuk, Z., & Oliński, K. (2008) · IFAC Proceedings Volumes · doi:10.3182/20080706-5-kr-1001.02372 · Cited by 1
Johnson, B. A. (2014) · Cited by 1
The computational complexity of continuous-discrete bilevel network problems
Gassner, E. (2009) · Cited by 1
Toolgraph Design of Optimal and Feasible Control Strategies for Time‐Varying Dynamical Systems
Kowalczuk, Z., & Oliński, K. (2012) · Mathematical Problems in Engineering · doi:10.1155/2012/142060 · Cited by 1
Piyatamrong, B., Ohara, S., & Kantakajorn, S. (2000) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1109/hpc.2000.846567 · Cited by 1
Algorithms for Searching Paths in Huge Graphs
Polyakov, I. V., Chepovskiy, A. A., & Chepovskiy, A. M. (2015) · Journal of Mathematical Sciences · doi:10.1007/s10958-015-2612-1 · Cited by 1
Practical time-dependent and stochastic routing with historical measurements of travel times
Demeyer, S., Audenaert, P., Logghe, S., Pickavet, M., & Demeester, P. M. A. (2012) · Ghent University Academic Bibliography (Ghent University) · Cited by 1
Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs
Ding, W., & Qiu, K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26626-8_39 · Cited by 1
Approximating the restricted 1-center in graphs
Ding, W., & Qiu, K. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.04.044 · Cited by 1
SSSP on GPU Without Atomic Operation
Wang, F., Zhu, L., & Zhang, C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-31854-7_37 · Cited by 1
Graph-based Estimation of Information Divergence Functions
Wisler, A. A. (2017) · Cited by 1
Su, J.-M., Chang, C., Yang, T.-P., Chuang, C.-F., & Su, S.-Y. (2014) · doi:10.1109/smartcomp-w.2014.7046679 · Cited by 1
A Geometrical Explanation to the Optimality Concept of Minimum Cost Flows
Ghiyasvand, M. (2016) · Scientia Iranica · doi:10.24200/sci.2016.4012 · Cited by 1
Algorithms for Static and Dynamic Group Multicast Routing Under Bandwidth Constraints
Tsai, K., & Chen, C. (2005) · Journal of information science and engineering · Cited by 1
Raghavachari, B. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b16812-8 · Cited by 1
Efficient assembly consensus algorithms for divergent contig sets
Château, A., Davot, T., & Lafond, M. (2021) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2021.107516 · Cited by 1
Gouaillard, A. (2005) · Cited by 1
Approximation Algorithms for Bandwidth Consecutive Multicolorings
Obata, Y., & Nishizeki, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08016-1_18 · Cited by 1
How to grow more pairs: suggesting review targets for comparison-friendly review ecosystems
Cook, J., Fabrikant, A., & Hassidim, A. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488410 · Cited by 1
Insertion/Deletion algorithms on M-heap with an array representation
Jung, H.-J. (2006) · The KIPS Transactions PartA · doi:10.3745/kipsta.2006.13a.3.261 · Cited by 1
Design Time Methodology for the Formal Modeling and Verification of Smart Environments
Sanaullah, M. (2014) · PubMed · doi:10.6092/polito/porto/2536725 · Cited by 1
The Quest for the Shortest Route
Demetrescu, C., & Italiano, G. F. (2013) · Springer eBooks · doi:10.1007/978-3-642-39652-6_4 · Cited by 1
Cruz‐Barbosa, R., Bautista-Villavicencio, D., & Vellido, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21587-2_4 · Cited by 1
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
Madani, O., Thorup, M., & Zwick, U. (2009) · Symposium on Discrete Algorithms · doi:10.5555/1496770.1496874 · Cited by 1
A SIMPLE ARRAY VERSION OF M-HEAP
Jung, H. (2014) · International Journal of Foundations of Computer Science · doi:10.1142/s012905411450004x · Cited by 1
Dynamic Survivable Routing with M-Trails
Tapolcai, J., Ho, P., Babarczi, P., & Rónyai, L. (2014) · Springer eBooks · doi:10.1007/978-1-4614-7738-9_7 · Cited by 1
The address connector: noninvasive synchronization of hierarchical data sources
Augsten, N., Böhlen, M. H., & Gamper, J. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-012-0582-x · Cited by 1
On the family of shortest isothetic paths in a digital object—An algorithm with applications
Dutt, M., Biswas, A., Bhowmick, P., & Bhattacharya, B. B. (2014) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2014.07.001 · Cited by 1
Cheng, Y.-H., & Chen, D. (2012) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-012-0175-1 · Cited by 1
Vandecasteele, H., & Janssens, G. (2003) · Theory and Practice of Logic Programming · doi:10.1017/s1471068402001618 · Cited by 1
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
Bilò, D., Gualà, L., & Proietti, G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40450-4_14 · Cited by 1
Malistov, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-14364-4_71 · Cited by 1
Approximate Distance Oracles for Graphs with Dense Clusters
Andersson, M., Gudmundsson, J., & Levcopoulos, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30551-4_7 · Cited by 1
Approximation algorithm for minimum cost flow allocation with varied survivability
Lahoud, S., Texier, G., & Toutain, L. (2006) · Next Generation Internet Networks (NGI) · doi:10.1109/ngi.2006.1678254 · Cited by 1
GENERALIZED FIBONACCI SEQUENCE AND ITS PROPERTIES
Patel, V. R., & Shah, D. V. (2014) · Cited by 1
Algorithmes de contournement de barrières
Briquet, C. (2003) · Cited by 1
Region-Based Geospatial Abduction
Shakarian, P., & Subrahmanian, V. S. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1794-1_3 · Cited by 1
The model of Ebola disease control and optimization algorithm of pharmaceutical logistics path
Yan, S. (2015) · International Conference on Biomedical Engineering and Informatics (BMEI) · doi:10.1109/bmei.2015.7401617 · Cited by 1
A Study on Edge Effects with the K-function Method on a Network
Morita, M., & Okunuki, K. (2006) · Chirigaku hyouron · doi:10.4157/grj.79.2_82 · Cited by 1
Mutual k-Nearest Neighbor Graph Construction in Graph-based Semi-Supervised Classification
Ozaki, K., Shimbo, M., Komachi, M., & Matsumoto, Y. (2013) · Transactions of the Japanese Society for Artificial Intelligence · doi:10.1527/tjsai.28.400 · Cited by 1
Programming and Construction of AHMEDULLAHBOT-A Fast Grid-Solving Robot
Aziz, A., Hossain, M. S., & Rahman, M. W. (2013) · International Journal of Information Technology Control and Automation · doi:10.5121/ijitca.2013.3102 · Cited by 1
Ji, B. (2012) · OhioLink ETD Center (Ohio Library and Information Network) · Cited by 1
A Preliminary Study on Minimum Spanning Tree Algorithm Approach for Travelling Salesman Problem
Baidoo, E. (2016) · Communications on Applied Electronics · doi:10.5120/cae2016652386 · Cited by 1
New Parameterized Algorithms for APSP in Directed Graphs
Porat, E., Shahbazian, E., & Tov, R. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.esa.2016.72 · Cited by 1
Algebraic theory on shortest paths for all flows
Takaoka, T. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.08.007 · Cited by 1
Bipartite Matching with Linear Edge Weights
Domaniç, N. O., Lam, C.-K., & Plaxton, C. G. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.isaac.2016.28 · Cited by 1
Mining Multi-Objective Minimal Commitment Decision Significance via Cluster-and-Find-Changes
Knerr, N., & Selva, D. (2017) · AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference (SDM) · doi:10.2514/6.2017-0972 · Cited by 1
All‐in‐one implementation framework for binary heaps
Katajainen, J. (2016) · Software Practice and Experience · doi:10.1002/spe.2423 · Cited by 1
Tile map size optimization for real world routing by using differential evolution
Camero, A., Arellano‐Verdejo, J., Cintrano, C., & Alba, E. (2017) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2017.7969478 · Cited by 1
Navigating Weighted Regions with Scattered Skinny Tetrahedra
Cheng, S.-W., Chiu, M.-K., Jin, J., & Vigneron, A. (2017) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195917600020 · Cited by 1
A Weighted Maximum Matching Algorithm for Influence Maximization and Structural Controllability
Sartor, G., Chia, Y.-K., Wynter, L., & Ruths, J. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.2288 · Cited by 1
A linear time pre-processing for optimization of shortest path and distance algorithms
Eapen, N. A., & Beegom, A. S. A. (2017) · IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES) · doi:10.1109/spices.2017.8091313 · Cited by 1
New Models for Two Variants of Popular Matching
Chisca, D. S., Siala, M., Simonin, G., & O’Sullivan, B. (2017) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2017.00119 · Cited by 1
A Geometric Path-Planning Algorithm in Cluttered Planar Environments Using Convex Hulls
Masoudi, N., & Fadel, G. (2018) · ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC/CIE) · doi:10.1115/detc2018-85384 · Cited by 1
A Filtering Technique for All Pairs Approximate Parameterized String Matching
Дас, Ш. (2018) · Communications in computer and information science · doi:10.1007/978-981-13-0023-3_10 · Cited by 1
Ranking Mechanism Design for Price-setting Agents in E-commerce
Cai, Q., Tang, P., & Zeng, Y. (2018) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/vken4856 · Cited by 1
Identifying Propagation Source in Large-Scale Networks
Jiang, J., Wen, S., Yu, S., Liu, B., Xiang, Y., & Zhou, W. (2018) · Advances in information security · doi:10.1007/978-3-030-02179-5_12 · Cited by 1
Improving the output of algorithms for large-scale approximate graph matching
Lubars, J. (2018) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents
Chalopin, J., Das, S., Disser, Y., Labourel, A., & Mihaľák, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-24922-9_10 · Cited by 1
Grundlagen der Navigation in komplexen Umgebungen
Feld, S. (2019) · Springer eBooks · doi:10.1007/978-3-658-26270-9_2 · Cited by 1
Bayesian generalized network design
Emek, Y., Kutten, S., Lavi, R., & Shi, Y. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.07.010 · Cited by 1
Exact Distance Query in Large Graphs through Fast Graph Simplification
Liu, J., Pan, Y., & Hu, Q. (2020) · The Computer Journal · doi:10.1093/comjnl/bxz147 · Cited by 1
Thwarting Adversaries with Randomness and Irrationality
Aggarwal, A. (2019) · UNM’s Digital Repository (University of New Mexico) · Cited by 1
Min-max controllable risk problems
Гуревский, Е. Е., Kovalev, S., & Kovalyov, M. Y. (2020) · 4OR · doi:10.1007/s10288-020-00434-1 · Cited by 1
Enumerating Grid Layouts of Graphs
Damaschke, P. (2020) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00541 · Cited by 1
Andrica, D., & Bagdasar, O. D. (2020) · Problem books in mathematics · doi:10.1007/978-3-030-51502-7_2 · Cited by 1
A Heuristic Algorithm to Find a Path to be Blocked by Minimizing Traffic Disruption
Das, M., Ambati, S. S., & Chandrasekaran, K. (2020) · IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER) · doi:10.1109/discover50404.2020.9278058 · Cited by 1
Finding MST by Considering Increasing Cost Order of the Edges Incident on Vertices
Srinivas, R., Lalitha, R. V. S., Reddy, T. R., & Anuja, B. D. (2021) · Lecture notes in networks and systems · doi:10.1007/978-981-16-0980-0_15 · Cited by 1
Applicability of Analytical Tree Search Algorithms in Network Routing
Ćavar, I., & Valencic, D. (2011) · Annals of DAAAM for ... & proceedings of the ... International DAAAM Symposium · doi:10.2507/22nd.daaam.proceedings.644 · Cited by 1
Application of Fibonacci heap to fast marching method
Meng, F., Liu, M., Zhang, P., Yang, J., Li, M., & Jiguo, D. (2021) · Open Physics · doi:10.1515/phys-2021-0030 · Cited by 1
An Edge-Fencing Strategy for Optimizing SSSP Computations on Large-Scale Graphs
Yu, H., Wang, X., & Luo, Y. (2021) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3472456.3472482 · Cited by 1
Spanning Trees and Arborescences
Körte, B., & Vygen, J. (2000) · Algorithms and combinatorics · doi:10.1007/978-3-662-21708-5_6 · Cited by 1
Williamson, D. P. (2019) · Cambridge University Press eBooks · doi:10.1017/9781316888568.004 · Cited by 1
Quantum Grid: Toward Future Energy Transformation
Samanvita, N., Raman, S., Gatade, S., Kumar, A., & Kulkarni, S. V. (2022) · Advances in intelligent systems and computing · doi:10.1007/978-981-16-9573-5_40 · Cited by 1
On simulating the resilience of military hub and spoke networks
Bryce, R., Pall, R., & Ghanmi, A. (2013) · Winter Simulation Conference · doi:10.1109/wsc.2013.6721659 · Cited by 1
Körte, B., & Vygen, J. (2011) · Algorithms and combinatorics · doi:10.1007/978-3-642-24488-9_7 · Cited by 1
Körte, B., & Vygen, J. (2000) · Algorithms and combinatorics · doi:10.1007/978-3-662-21708-5_7 · Cited by 1
Minimum Spanning Paths and Hausdorff Distance in Finite Ultrametric Spaces
Petrov, E. (2022) · P-Adic Numbers Ultrametric Analysis and Applications · doi:10.1134/s2070046622020054 · Cited by 1
1D and 2D Flow Routing on a Terrain
Arge, L., Lowe, A., Svendsen, S. C., & Agarwal, P. K. (2022) · ACM Transactions on Spatial Algorithms and Systems · doi:10.1145/3539660 · Cited by 1
Dynamic Programming and Shortest Path
Du, D., Pardalos, P. M., Hu, X., & Wu, W. (2022) · Springer optimization and its applications · doi:10.1007/978-3-031-10596-8_3 · Cited by 1
Design and Evaluation of IoT Gateway for Data Prioritization based on Van Emde Boas Tree
Araújo, I. P., de Araujo, R. C. R., Ribeiro, M. A., Ishikawa, E., Reis, A. C. B., & Rodopoulos, C. A. M. (2022) · International Conference on Future Internet of Things and Cloud (FiCloud) · doi:10.1109/ficloud57274.2022.00040 · Cited by 1
Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract)
Cao, N., Fineman, J. T., & Russell, K. (2023) · ACM Workshop on Highlights of Parallel Computing (HOPC) · doi:10.1145/3597635.3598019 · Cited by 1
Refined statistical attacks against searchable symmetric encryption using non-indexed documents
Du, R., Tai, Y., & Li, M. (2023) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2023.103652 · Cited by 1
A Bayesian Spatial Scan Statistics for Multinomial Data
Self, S. C. W., & Nolan, M. S. (2023) · Statistics & Probability Letters · doi:10.1016/j.spl.2023.110005 · Cited by 1
Razumovsky, А. V., Saramud, M. V., & Pikalov, Y. Y. (2024) · Vestnik NSU Series Information Technologies · doi:10.25205/1818-7900-2023-21-4-54-70 · Cited by 1
Resilient Network Design: Disjoint Shortest Path Problem for Power Transmission Application
Jha, A., Song, H., & Zinchenko, Y. (2024) · Systems · doi:10.3390/systems12040117 · Cited by 1
Resiliency in Networks Through Meshed Trees
Willis, P., Shenoy, N., Hamilton, J., & Pan, Y. (2024) · International Conference on the Network of the Future (NOF) · doi:10.1109/nof62948.2024.10741359 · Cited by 1
Efficient online sensitivity analysis for the injective bottleneck path problem
Kaymakov, K. V., & Malyshev, D. S. (2024) · Optimization Letters · doi:10.1007/s11590-024-02170-5 · Cited by 1
Suppressing the Endogenous Negative Influence Through Node Intervention in Social Networks
Furutani, S., Aoshima, T., Shibahara, T., Akiyama, M., & Aida, M. (2024) · IEEE Access · doi:10.1109/access.2024.3523036 · Cited by 1
GQ*: Towards Generalizable Deep Q-Learning for Steiner Tree in Graphs
Huang, W., Wang, H., Wen, D., Chen, X., Zhang, W., & Zhang, Y. (2024) · Proceedings · doi:10.1109/icdm59182.2024.00021 · Cited by 1
Route Generation Heuristics for the Automated Creation of Hot Spots Policing Patrol Routes
Nunes, F. C. F., Matias, J. A. S., Chainey, S., da Silva, T. L. C., de Macêdo, J. A. F., Magalhães, R. P., Neto, J. F. D. Q., & Silva, W. C. P. (2025) · Geotechnologies and the environment · doi:10.1007/978-3-031-81580-5_6 · Cited by 1
An Indoor-Oriented Localization And Navigation System
Bao, Q. (2019) · OhioLink ETD Center (Ohio Library and Information Network) · Cited by 1
Yeh, W., Forghani-elahabad, M., & Kumar, A. (2026) · Scientific Reports · doi:10.1038/s41598-026-51627-3 · Cited by 1
Load Balancing in Multiprocessor Systems
Loui, M. C., & Sohoni, M. A. (1989) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1
A Simple Extreme Subsets Algorithm for Submodular and Posi-modular Set Functions
Nagamochi, H. (2007) · Cited by 1
An O(M log M) Algorithm for Bipartite Matching with Roadmap DistancesPreprint
Treleaven, K., Bialkowski, J., & Frazzoli, E. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.4609 · Cited by 1
A pointer-free data structure for merging heaps and min-max heaps
Gambosi, G., Nardelli, E., & Talamo, M. (1989) · Lecture notes in computer science · doi:10.1007/bfb0035773 · Cited by 1
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.