2 search results - page 1 / 1 » A Randomized Linear Work EREW PRAM Algorithm to Find a Minim... |
ISAAC
1997
Springer
13 years 9 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
RANDOM
1999
Springer
13 years 9 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...