A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees

A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees (1994)

by David R. Karger , Philip N. Klein , Robert E. Tarjan

Citations:

98 - 7 self

User correction supplied by mph

Datum	Value	Source
TITLE	A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees	user correction - Legacy Corrections
AUTHOR NAME	David R. Karger	user correction
AUTHOR AFFIL	MIT	user correction
AUTHOR NAME	Philip N. Klein	user correction
AUTHOR AFFIL	Brown University	user correction
AUTHOR NAME	Robert E. Tarjan	user correction
AUTHOR AFFIL	Princeton University; and NEC Research Institute	user correction
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.	user correction
YEAR	1994	user correction
CITATIONS	23 found	ParsCit 1.0