A minimum spanning tree algorithm with inverse-Ackermann type complexity

@article{Chazelle2000AMS,
  title={A minimum spanning tree algorithm with inverse-Ackermann type complexity},
  author={Bernard Chazelle},
  journal={J. ACM},
  year={2000},
  volume={47},
  pages={1028-1047}
}
  • B. Chazelle
  • Published 1 November 2000
  • Computer Science
  • J. ACM
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is <italic>0</italic>(<italic>m</italic> α(<italic>m, n</italic>)), where α is the classical functional inverse of Ackermann's function and <italic>n</italic> (respectively, <italic>m</italic>) is the number of vertices (respectively, edges). The algorithm is comparison-based : it uses pointers, not arrays, and it makes no numeric assumptions on the edge costs. 

Figures from this paper

Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree or shortest path tree in O(m log α(m,n)) time, where α is the inverse-Ackermann function. This improves
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
  • Seth Pettie
  • Computer Science
    J. Graph Algorithms Appl.
  • 2015
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in $O(m\log\alpha(m,n))$ time, where $\alpha$ is the inverse-Ackermann
An Optimal Minimum Spanning Tree Algorithm
TLDR
A deterministic algorithm to find a minimum spanning forest of a graph with n vertices and m edges that runs in time O(Τ*(m, n) where Τ* is the minimum number of edge-weight comparisons needed to determine the solution, which is quite simple and can be implemented on a pointer machine.
Minimum Spanning Tree in Deterministic Linear Time For Graphs of High Girth
We show a simple deterministic linear time algorithm for computing the minimum spanning tree of graphs on n vertices with girth at least b(t, lg n), where t ≥ 1 is a constant and b(x, y) is a variant
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
TLDR
A new linear-time algorithm is presented for the tree-path-maxima problem of computing for each pair (u,v) on the list a maximum-weight edge on the path in T between u and v, which may be considered significantly simpler than the earlier solutions.
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*
TLDR
It is proved that there are no linear-time solutions to the online MST verification problem, and in particular, that answering m queries requires Ω(mα(m,n)) time, where α( m,n) is the inverse-Ackermann function and n is the size of the tree.
Minimum Spanning Trees
TLDR
Two classical algorithms are discussed: Prim's algorithm and Kruskal's algorithm, followed by recent developments that improve the asymptotic time bounds using advanced data structures.
An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs
TLDR
An optimal deterministic O(n)-work parallel algorithm for finding a minimum spanning tree on an n-vertex planar graph that holds for any sparse graph that is closed under taking of minors and for a class of graphs with non-bounded genus.
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
TLDR
The problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights is considered and a deterministic algorithm achieving a competitive ratio of $\mathcal{O}(n^2)$ is provided and a lower bound for randomized algorithms of i¾?(logn).
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
TLDR
The algorithm takes the hierarchy-based approach invented by Thorup, and, if the ratio between the maximum and minimum edge lengths is bounded by n(log n)O(1), it can solve the single-source problem in O(m + n log log n) time.
...
...

References

SHOWING 1-10 OF 23 REFERENCES
Finding Minimum Spanning Trees
TLDR
This paper studies methods for finding minimum spanning trees in graphs and results include relationships with other problems which might lead general lower bound for the complexity of the minimum spanning tree problem.
Linear Verification for Spanning Trees
  • J. Komlos
  • Mathematics, Computer Science
    FOCS
  • 1984
TLDR
An algorithm which finds the maximum value of every one of the given paths, and which uses only 5n + n log [(|A|+n)/n] comparisons, leads to a spanning tree verification algorithm using O(n+e) comparisons in a graph with n vertices and e edges.
Linear verification for spanning trees
  • J. Komlos
  • Mathematics, Computer Science
    Comb.
  • 1985
TLDR
An algorithm which finds the maximum value of every one of the given paths, and which uses only O(n+e) comparisons in a graph with n vertices and e edges is described.
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
TLDR
This paper describes a linear-time algorithm for verifying a minimum spanning tree and combines the result of Komlos with a preprocessing and table look-up method for small subproblems and with a previously known almost-linear- time algorithm.
A randomized linear-time algorithm to find minimum spanning trees
TLDR
A randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights is presented, a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
TLDR
This paper uses F-heaps to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs and can be extended to allow a degree constraint at one vertex.
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
  • M. Fredman, D. Willard
  • Computer Science
    Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
The fusion tree method is extended to develop a linear-time algorithm for the minimum spanning tree problem and an O(m+n log n/log log n) implementation of Dijkstra's shortest-path algorithm for a
On the History of the Minimum Spanning Tree Problem
TLDR
There are several apparently independent sources and algorithmic solutions of the minimum spanning tree problem and their motivations, and they have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century.
The complexity of computing partial sums off-line
Given an array A with n entries in an additive semigroup, and m intervals of the form Ii=[i,j], where 0<i<j≤n, we show that the computation of A[i]+⋯+A[j] for all Ii, requires Ω(n+mα(m,n)) semigroup
...
...