A randomized linear-time algorithm for finding minimum spanning trees

  title={A randomized linear-time algorithm for finding minimum spanning trees},
  author={Philip N. Klein and Robert E. Tarjan},
We present a randomized linear-time algorithm for finding a minimum spanning tree in a connect ed graph with edge weights. 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. 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 full version of this paper will… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-2 of 2 references

Approximating, verify- Algorithms, Chapter 6, Society fo:r Industrial and Applied Mathematics, Philadeling, and constructing minimum spanning forests,

  • D. R. Karger
  • phia,
  • 1992
Highly Influential
12 Excerpts

Similar Papers

Loading similar papers…