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 601–700 of 3,140
Anytime QoS-aware service composition over the GraphPlan
Yan, Y., & Chen, M. (2013) · Service Oriented Computing and Applications · doi:10.1007/s11761-013-0134-6 · Cited by 37
A Joint Graph Model for Pinyin-to-Chinese Conversion with Typo Correction
Jia, Z., & Zhao, H. (2014) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/v1/p14-1142 · Cited by 37
A Multi-Hop Clustering Mechanism for Scalable IoT Networks
Sung, Y.-Y., Lee, S., & Lee, M. (2018) · Sensors · doi:10.3390/s18040961 · Cited by 37
A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression
Karpov, N. V., Malikić, S., Rahman, M. K., & Şahinalp, S. C. (2019) · Algorithms for Molecular Biology · doi:10.1186/s13015-019-0152-9 · Cited by 37
A Hybrid Link‐Node Approach for Finding Shortest Paths in Road Networks with Turn Restrictions
Li, Q., Chen, B. Y., Wang, Y., & Lam, W. H. K. (2015) · Transactions in GIS · doi:10.1111/tgis.12133 · Cited by 37
Geodesic Gaussian kernels for value function approximation
Sugiyama, M., Hachiya, H., Towell, C., & Vijayakumar, S. (2008) · Autonomous Robots · doi:10.1007/s10514-008-9095-6 · Cited by 37
Practical parallel algorithms for minimum spanning trees
Dehne, F., & Götz, S. (2002) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.1998.740525 · Cited by 37
Elections with Few Candidates: Prices, Weights, and Covering Problems
Bredereck, R., Faliszewski, P., Niedermeier, R., Skowron, P., & Talmon, N. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23114-3_25 · Cited by 37
Akgül, M. (1992) · Springer eBooks · doi:10.1007/978-3-642-77489-8_5 · Cited by 37
Acoustic formulation of elastic guided wave propagation and scattering in curved tubular structures
Brath, A. J., Simonetti, F., Nagy, P. B., & Instanes, G. (2014) · IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control · doi:10.1109/tuffc.2014.2973 · Cited by 37
The shortest path problem on large‐scale real‐road networks
Klunder, G. A., & Post, H. (2006) · Networks · doi:10.1002/net.20131 · Cited by 37
Finding the detour-critical edge of a shortest path between two nodes
Nardelli, E., Proietti, G., & Widmayer, P. (1998) · Information Processing Letters · doi:10.1016/s0020-0190(98)00077-5 · Cited by 37
Light graphs with small routing cost
Wu, B. Y., Chao, K., & Tang, C. Y. (2002) · Networks · doi:10.1002/net.10019 · Cited by 37
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
Arar, M., Chechik, S., Cohen, S., Stein, C., & Wajc, D. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2018.7 · Cited by 36
Optimized Mobile Crane Path Planning in Discretized Polar Space
Mousaei, A., Taghaddos, H., Tak, A. N., Behzadipour, S., & Hermann, U. (2021) · Journal of Construction Engineering and Management · doi:10.1061/(asce)co.1943-7862.0002033 · Cited by 36
Arkin, E. M., Khuller, S., & Mitchell, J. S. B. (1993) · Algorithmica · doi:10.1007/bf01769706 · Cited by 36
Lightweight People Counting and Localizing for Easily Deployable Indoors WSNs
Teixeira, T., & Savvides, A. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2008.2001426 · Cited by 36
Paredes, R., & Navarro, G. (2006) · Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611972863.16 · Cited by 36
DSMR: A Parallel Algorithm for Single-Source Shortest Path Problem
Maleki, S., Nguyen, D. D., Lenharth, A., Garzarán, M. J., Padua, D., & Pingali, K. K. (2016) · International Conference on Supercomputing · doi:10.1145/2925426.2926287 · Cited by 36
Shortest vertex-disjoint two-face paths in planar graphs
de Verdière, É. C., & Schrijver, A. (2011) · ACM Transactions on Algorithms · doi:10.1145/1921659.1921665 · Cited by 36
An experimental comparison of two distributed single-source shortest path algorithms
Träff, J. L. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00025-j · Cited by 36
Xue, G. (2002) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/pccc.2000.830328 · Cited by 36
Klein, P. N., Stein, C., & Eva Tardos, D. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100257 · Cited by 36
Electric Vehicle Routing with Realistic Recharging Models
Zündorf, T. (2014) · Cited by 36
The Tractability of CSP Classes Defined by Forbidden Patterns
Cohen, D. A., Cooper, M., Creed, P., Marx, D., & Salamon, A. Z. (2012) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3651 · Cited by 35
Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
Bünnagel, U., Körte, B., & Vygen, J. (1998) · Optimization methods & software · doi:10.1080/10556789808805709 · Cited by 35
Fast and effective distribution-key recommendation for amazon redshift
Parchas, P., Naamad, Y., Bouwel, P. V., Faloutsos, C., & Petropoulos, M. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407834 · Cited by 35
Incrementalizing Graph Algorithms
Fan, W., Tian, C., Xu, R., Yin, Q., Yu, W., & Zhou, J. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3452796 · Cited by 35
Time-work tradeoffs for parallel algorithms
Spencer, T. H. (1997) · Journal of the ACM · doi:10.1145/265910.265923 · Cited by 35
Finding shortest non-trivial cycles in directed graphs on surfaces
Cabello, S., de Verdière, É. C., & Lazarus, F. (2010) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1810959.1810988 · Cited by 35
Embedding, clustering and coloring for dynamic maps
Hu, Y., Kobourov, S., & Veeramoni, S. (2012) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2012.6183571 · Cited by 35
Kaplan, H. Y., Shafrir, N., & Tarjan, R. E. (2002) · Symposium on Discrete Algorithms · doi:10.5555/545381.545384 · Cited by 35
Self-citationA Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs
Ramshaw, L., & Tarjan, R. E. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.9 · Cited by 35
Self-citationCostly circuits, submodular schedules and approximate Carathéodory Theorems
Venkatakrishnan, S. B., Alizadeh, M., & Viswanath, P. (2017) · Queueing Systems · doi:10.1007/s11134-017-9546-x · Cited by 35
Generic ε-Removal Algorithm for Weighted Automata
Mohri, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44674-5_19 · Cited by 35
A faster deterministic algorithm for minimum spanning trees
Chazelle, B. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646089 · Cited by 35
Search-Space Size in Contraction Hierarchies
Bauer, R., Columbus, T., Rutter, I., & Wagner, D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39206-1_9 · Cited by 34
Sharma, A., & Kumar, N. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2021.3052072 · Cited by 34
Finding k shortest simple paths in directed graphs: A node classification algorithm
Feng, G. (2014) · Networks · doi:10.1002/net.21552 · Cited by 34
Huang, S., & Liu, Z. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00444-x · Cited by 34
ResilientWireless Sensor Networks Using Topology Control: A Review
Huang, Y., Martínez-Ortega, J.-F., Sendra, J., & López, L. (2015) · Sensors · doi:10.3390/s151024735 · Cited by 34
Shortest paths on dynamic graphs
Nannicini, G., & Liberti, L. (2008) · International Transactions in Operational Research · doi:10.1111/j.1475-3995.2008.00649.x · Cited by 34
A Framework for Optimal Grasp Contact Planning
Hang, K., Stork, J. A., Pollard, N. S., & Kragić, D. (2017) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2017.2651381 · Cited by 34
Adaptive Asynchronous Parallelization of Graph Algorithms
Fan, W., Lü, P., Luo, X., Xu, J., Yin, Q., Yu, W., & Xu, R. (2018) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3183713.3196918 · Cited by 34
Approximate Shortest Paths in Anisotropic Regions
Cheng, S.-W., Na, H.-S., Vigneron, A., & Wang, Y. (2008) · SIAM Journal on Computing · doi:10.1137/06067777x · Cited by 34
Shortest paths in stochastic networks with ARC lengths having discrete distributions
Corea, G. A., & Kulkarni, V. G. (1993) · Networks · doi:10.1002/net.3230230305 · Cited by 34
All-pairs bottleneck paths in vertex weighted graphs
Shapira, A., Yuster, R., & Zwick, U. (2007) · Symposium on Discrete Algorithms · doi:10.5555/1283383.1283488 · Cited by 34
A note on practical construction of maximum bandwidth paths
Malpani, N., & Chen, J. (2002) · Information Processing Letters · doi:10.1016/s0020-0190(01)00323-4 · Cited by 34
An incremental approach to aesthetic graph layout
Miriyala, K., Hornick, S. W., & Tamassia, R. (2002) · International Workshop on Computer-Aided Software Engineering (CASE) · doi:10.1109/case.1993.634832 · Cited by 34
Schultz, M. (2010) · Qucosa (Saxon State and University Library Dresden) · Cited by 34
Shortest Path Computation: A Comparative Analysis
Sherlock, R., Mooney, P., Winstanley, A. C., & Husdal, J. (2002) · Maynooth University ePrints and eTheses Archive (Maynooth University) · Cited by 33
Dalyac, C., Henry, L.-P., Kim, M., Ahn, J., & Henriet, L. (2023) · Physical Review A · doi:10.1103/physreva.108.052423 · Cited by 33
Single-Source Shortest Paths with Negative Real Weights in Õ(𝑚𝑛 8/9 ) Time
Fineman, J. T. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649614 · Cited by 33
Finding Alternative Shortest Paths in Spatial Networks
Xie, K., Deng, K., Shang, S., Zhou, X., & Zheng, K. (2012) · ACM Transactions on Database Systems · doi:10.1145/2389241.2389248 · Cited by 33
A Reliability and latency-aware routing framework for 5G transport infrastructures
Palmieri, F. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107365 · Cited by 33
Generalized Maximum Flows over Time
Groß, M., & Skutella, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29116-6_21 · Cited by 33
Liu, L., Song, Y., Ma, H., & Zhang, X. (2012) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2012.6195492 · Cited by 33
An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation
Farnoud, F., & Milenković, O. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2345760 · Cited by 33
A survey of concurrent priority queue algorithms
Dragičević, K., & Bauer, D. (2008) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2008.4536331 · Cited by 33
Hierarchical path computation approach for large graphs
Rajagopalan, R., Mehrotra, K. G., Mohan, C. K., & Varshney, P. K. (2008) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2008.4560197 · Cited by 33
Efficient Many-To-Many Point Matching in One Dimension
Colannino, J., Damian, M., Hurtado, F., Langerman, S., Meijer, H., Ramaswami, S., Souvaine, D. L., & Toussaint, G. (2007) · Graphs and Combinatorics · doi:10.1007/s00373-007-0714-3 · Cited by 33
Maintaining Longest Paths Incrementally
Katriel, I., Michel, L. D., & Hentenryck, P. V. (2005) · Constraints · doi:10.1007/s10601-005-0554-9 · Cited by 33
Path planning in 0/1/ weighted regions with applications
Gewali, L. P., Meng, A. C., Mitchell, J. S. B., & Ntafos, S. C. (1988) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/73393.73421 · Cited by 33
Geodesic Paths On 3D Surfaces: Survey and Open ProblemsPreprint
Maheshwari, A., & Wuhrer, S. (2009) · NPARC · doi:10.4224/16931693 · Cited by 33
The soft heap: an approximate priority queue with optimal error rate
Chazelle, B. (2000) · Journal of the ACM · doi:10.1145/355541.355554 · Cited by 32
Time version of the shortest path problem in a stochastic-flow network
Lin, Y. (2008) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2008.09.003 · Cited by 32
Algorithms for the quickest path problem and the reliable quickest path problem
Calvete, H. I., del-Pozo, L., & Iranzo, J. A. (2012) · Computational Management Science · doi:10.1007/s10287-012-0138-2 · Cited by 32
Li, C., Zhang, Y., Hao, Z., & Luo, Y. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107096 · Cited by 32
Optimizing vehicle routes in a bakery company allowing flexibility in delivery dates
Pacheco, J., Álvarez, A., García-Calvillo, I. D., & Ángel-Bello, F. (2011) · Journal of the Operational Research Society · doi:10.1057/jors.2011.51 · Cited by 32
Providing built-in keyword search capabilities in RDBMS
Li, G., Feng, J., Zhou, X., & Wang, J. (2010) · The VLDB Journal · doi:10.1007/s00778-010-0188-4 · Cited by 32
Implementing weighted b-matching algorithms: insights from a computational study
Müller‐Hannemann, M., & Schwartz, A. (2000) · ACM Journal of Experimental Algorithmics · doi:10.1145/351827.384250 · Cited by 32
L* Algorithm—A Linear Computational Complexity Graph Searching Algorithm for Path Planning
Niewola, A., & Podsędkowski, L. (2017) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-017-0748-6 · Cited by 32
de Almeida, V. T., & Güting, R. H. (2006) · ACM Symposium on Applied Computing · doi:10.1145/1141277.1141291 · Cited by 32
Finding the shortest paths by node combination
Lu, X. B., & Camitz, M. (2011) · Applied Mathematics and Computation · doi:10.1016/j.amc.2011.01.019 · Cited by 32
AN OPTIMAL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS ON TRAPEZOID GRAPHS
Mondal, S., Pal, M., & Pal, T. K. (2002) · International Journal of Computational Engineering Science · doi:10.1142/s1465876302000575 · Cited by 32
Minkowski-type theorems and least-squares partitioning
Aurenhammer, F., Hoffman, F., & Aronov, B. S. (1992) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/142675.142747 · Cited by 32
Efficient algorithms for finding the most vital edge of a minimum spanning tree
Iwano, K., & Katoh, N. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90082-k · Cited by 32
Testing the necklace condition for shortest tours and optimal factors in the plane
Edelsbrunner, H., Rote, G., & Welzl, E. (1989) · Theoretical Computer Science · doi:10.1016/0304-3975(89)90133-3 · Cited by 32
Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks
Chen, B. Y., Lam, W. H. K., & Li, Q. (2016) · Journal of Advanced Transportation · doi:10.1002/atr.1408 · Cited by 32
Zwick, U. (2006) · Algorithmica · doi:10.1007/s00453-005-1199-1 · Cited by 32
Buckets, heaps, lists, and monotone priority queues
Cherkassky, B. V., Goldberg, A. V., & Silverstein, C. D. (1997) · Symposium on Discrete Algorithms · doi:10.5555/314161.314187 · Cited by 32
Garofolo, J. S., Bowers, R., Moellman, D. E., Kasturi, R., Goldgof, D. B., & Soundararajan, P. (2006) · Cited by 32
Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks
Yang, J., & Chen, Y. (2011) · PLoS ONE · doi:10.1371/journal.pone.0022557 · Cited by 31
Smooth Heaps and a Dual View of Self-Adjusting Data Structures
Kozma, L., & Saranurak, T. (2018) · SIAM Journal on Computing · doi:10.1137/18m1195188 · Cited by 31
SPARE: Shortest Path Global Item Relations for Efficient Session-based Recommendation
Peintner, A., Mohammadi, A. R., & Zangerle, E. (2023) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/3604915.3608768 · Cited by 31
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
Cooper, M., & Zivny, S. (2012) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3598 · Cited by 31
Kaplan, H. Y., & Tarjan, R. E. (2008) · ACM Transactions on Algorithms · doi:10.1145/1328911.1328914 · Cited by 31
Self-citationCombinatorial algorithms for the generalized circulation problem
Goldberg, A. V., Plotkin, S. A., & Eva Tardos, D. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21959 · Cited by 31
A hybrid multi-path routing algorithm for industrial wireless mesh networks
Zuo, Y., Ling, Z., & Yuan, Y. (2013) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/1687-1499-2013-82 · Cited by 31
How to Draw ClusteredWeighted Graphs using a Multilevel Force-Directed Graph Drawing Algorithm
Bourqui, R., Auber, D., & Mary, P. (2007) · International Conference on Information Visualisation (IV) · doi:10.1109/iv.2007.65 · Cited by 31
The partial inverse minimum spanning tree problem when weight increase is forbidden
Cai, M.-C., Duin, C. W., Yang, X., & Zhang, J. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2007.04.031 · Cited by 31
An O(nm) time algorithm for finding the min length directed cycle in a graph
Orlin, J. B., & Sedeño‐Noda, A. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.122 · Cited by 31
Energy-Efficient Dynamic Virtual Machine Management in Data Centers
Han, Z., Tan, H., Wang, R., Chen, G., Li, Y., & Lau, F. C. M. (2019) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2019.2891787 · Cited by 31
How fast can we reach a target vertex in stochastic temporal graphs?
Akrida, E. C., Mertzios, G. B., Nikoletseas, S., Raptopoulos, C., Spirakis, P. G., & Zamaraev, V. (2020) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2020.05.005 · Cited by 31
Label switched protocol routing with guaranteed bandwidth and end to end path delay in MPLS networks
Soorki, M. N., & Rostami, H. (2014) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2014.03.008 · Cited by 31
Fair Matchings and Related Problems
Huang, C.-C., Kavitha, T., Mehlhorn, K., & Michail, D. (2015) · Algorithmica · doi:10.1007/s00453-015-9994-9 · Cited by 31
The partial sum criterion for Steiner trees in graphs and shortest paths
Duin, C. W., & Volgenant, A. (1997) · European Journal of Operational Research · doi:10.1016/s0377-2217(96)00113-0 · Cited by 31
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
Pettie, S., & Ramachandran, V. (2002) · Symposium on Discrete Algorithms · doi:10.5555/545381.545477 · Cited by 31
Spatialized audio streaming for networked virtual environments
Zimmermann, R., & Liang, K. (2008) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/1459359.1459400 · Cited by 31
Preprocessing the Steiner Problem in Graphs
Duin, C. W. (2000) · Combinatorial optimization · doi:10.1007/978-1-4757-3171-2_10 · Cited by 31
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.