A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees (1994)
Cached
Download Links
- [www.cs.brown.edu]
- [www.cs.brown.edu]
- [ftp.cs.princeton.edu]
- DBLP
Other Repositories/Bibliography
by
Richard Cole
,
Philip N. Klein
,
Robert E. Tarjan
| Citations: | 13 - 1 self |
BibTeX
@MISC{Cole94alinear-work,
author = {Richard Cole and Philip N. Klein and Robert E. Tarjan},
title = {A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give the first linear-work parallel algorithm for finding a minimum spanning tree. It is a randomized algorithm, and requires O(2^(log* n) log n) expected time. It is a modification of the sequential linear-time algorithm of Klein and Tarjan.
