Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

RANDOM
1999
Springer

favoriteEmaildiscussreport

91views Theoretical Computer Science» more RANDOM 1999»

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

13 years 8 months ago

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

Download www.cs.utexas.edu

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 EREW PRAM. This result is optimal with respect to both work and parallel time, and is the rst provably optimal parallel algorithm for this problem under both measures. 0

Seth Pettie, Vijaya Ramachandran

Real-time Traffic

Minimum Spanning Forest | Optimal Parallel Algorithm | RANDOM 1999 | Randomized Algorithm | Theoretical Computer Science |

claim paper

Related Content

» A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

» Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on ...

» Covering minimum spanning trees of random subgraphs

» A Functional Approach to External Graph Algorithms

» Approximating discrete probability distributions with causal dependence trees

» Minimum Cuts in NearLinear Time

» GIST GroupIndependent Spanning Tree for Data Aggregation in Dense Sensor Networks

» Guaranteed MinimumRank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

» Limits and Applications of Group Algebras for Parameterized Problems

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	RANDOM
Authors	Seth Pettie, Vijaya Ramachandran

Comments (0)