Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm

Abstract

We study parallel algorithms for the minimum spanning tree problem, based on the sequential algorithm of Borůvka. The target architectures for our algorithm are asynchronous, distributed-memory machines. Analysis of our parallel algorithm, on a simple model that is reminiscent of the LogP model, shows that in principle a speedup proportional to the number… (More)
DOI: 10.1109/IPPS.1996.508073

Topics

6 Figures and Tables

Statistics

0510'99'01'03'05'07'09'11'13'15'17
Citations per Year

81 Citations

Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Chung1996ParallelIO, title={Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm}, author={Sun Chung and Anne Condon}, booktitle={IPPS}, year={1996} }