Dec 15, 2014

A Parallel Algorithm for Computing Minimum Spanning Trees

A Parallel Algorithm for Computing Minimum Spanning Trees
Abstract: We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph vertices and edges on an EREW PRAM using n m processors. This represents a substantial improvement in the running time over the previous results for this problem using at the same time the weakest of the PRAM models. It also implies the existence of algorithms having the same complexity bounds for the EREW PRAM for connectivity ear decomposition
biconnectivity strong orientationnumbering and Euler tours problems.

Download Full Paper Click Here

Share this