A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees (1994)
Cached
Download Links
by
David R. Karger
,
Philip N. Klein
,
Robert E. Tarjan
| Citations: | 98 - 7 self |
BibTeX
@MISC{Karger94arandomized,
author = {David R. Karger and Philip N. Klein and Robert E. Tarjan},
title = {A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
