A randomized time-work optimal parallel algorithm for finding a minimum spanning forest (1999)
Cached
Download Links
- [www.eecs.umich.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM J. COMPUT |
| Citations: | 11 - 3 self |
BibTeX
@INPROCEEDINGS{Pettie99arandomized,
author = {Seth Pettie and Vijaya Ramachandran},
title = {A randomized time-work optimal parallel algorithm for finding a minimum spanning forest},
booktitle = {SIAM J. COMPUT},
year = {1999},
pages = {233--244},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an exclusive read exclusive write (EREW) PRAM. This result is optimal w.r.t. both work and parallel time, and is the first provably optimal parallel algorithm for this problem under both measures. We also give a simple, general processor allocation scheme for tree-like computations.
