A randomized linear-time algorithm to find minimum spanning trees

@article{Karger1995ARL,
  title={A randomized linear-time algorithm to find minimum spanning trees},
  author={David R. Karger and Philip N. Klein and Robert E. Tarjan},
  journal={J. ACM},
  year={1995},
  volume={42},
  pages={321-328}
}
We present a randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights. The algorithm uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons. 
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
TLDR
This work presents a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph that is optimal w.r.t. both work and parallel time, and is the first provably optimal parallel algorithm for this problem under both measures.
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
TLDR
A linear-time algorithm is given for the minimum-ratio spanning tree problem on planar graphs based on a new planar minimum spanning tree algorithm that extends to other parametric minimum spanning Tree problems on planAR graphs and to other families of graphs having small separators.
A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
TLDR
This is the first linear-work, polylog-time algorithm on the EREW PRAM for this problem and gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation—the QSM and the BSP.
On the parallel time complexity of undirected connectivity and minimum spanning trees
TLDR
This approach gives an algorithm that runs in O(log n) time using n + m processors on the EREW PRAM, settling a long-standing open problem in the literature.
Minimum cuts in near-linear time
  • D. Karger
  • Computer Science, Mathematics
    STOC '96
  • 1996
TLDR
A "semiduality" between minimum cuts and maximum spanning tree packings combined with the previously developed random sampling techniques is used to improve known time bounds for solving the minimum cut problem on undirected graphs.
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.
A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
TLDR
This work presents a randomized EREW PRAM algorithm that runs in o((log n) expected time for any > 0 and performs linear expected work on an nvertex graph and gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation.
Practical parallel algorithms for minimum spanning trees
  • F. Dehne, S. Götz
  • Computer Science
    Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)
  • 1998
TLDR
It is shown that simple algorithms with data-independent communication patterns are efficient both in theory and in practice for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges.
A New Algorithmic Approach to Finding Minimum Spanning Tree
TLDR
A different approach has been proposed where sets and disjoint sets union data structure are used for reducing the number of edges under consideration while determining minimum spanning tree of a graph.
A faster deterministic algorithm for minimum spanning trees
  • B. Chazelle
  • Computer Science
    Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
TLDR
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented, which improves on the previous, ten-year old bound of (roughly) O(m log log* m).
...
...

References

SHOWING 1-10 OF 54 REFERENCES
A randomized linear-time algorithm for finding minimum spanning trees
TLDR
The algorithm is a modification of one proposed by Karger and uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree in a connected graph with edge weights.
A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees
TLDR
This work gives the first linear-work parallel algorithm for a minimum spanning tree and is a randomized algorithm, and requires O(2 n logn) expected time.
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.
Random sampling in matroids, with applications to graph connectivity and minimum spanning trees
  • D.R. Karker
  • Computer Science, Mathematics
    Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
  • 1993
TLDR
An algorithm is given that uses simple data structures to construct an MST in O(m+n log n) time and bounds on the connectivity (minimum cut) of a graph suffering random edge failures are given.
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.
Can A Maximum Flow be Computed on o(nm) Time?
TLDR
It is shown that a maximum flow in a network with n vertices can be computed deterministically in O(n3/log n) time on a uniform-cost RAM, which improves the previous best bound of O( n3).
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
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.
Approximate and exact parallel scheduling with applications to list, tree and graph problems
  • R. Cole, U. Vishkin
  • Computer Science
    27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
TLDR
A novel scheduling problem is defined; it is solved by repeated, rapid, approximate reschedulings, which leads to a first optimal PRAM algorithm for list ranking, which runs in logarithmic time.
Applications of Path Compression on Balanced Trees
TLDR
A method for computing functions defined on paths in trees based on tree manipulation techniques first used for efficiently representing equivalence relations, which has an almost-linear running time and is useful for solving certain kinds of pathfinding problems on reducible graphs.
...
...