๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast Connected Components Algorithms for the EREW PRAM

โœ Scribed by Karger, David R.; Nisan, Noam; Parnas, Michal

Book ID
118177348
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
355 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast integer merging on the EREW PRAM
Fast integer merging on the EREW PRAM
โœ T. Hagerup; M. Kutyล‚owski ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Springer ๐ŸŒ English โš– 780 KB
Optimal Randomized EREW PRAM Algorithms
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests
โœ Shay Halperin; Uri Zwick ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 384 KB

We present the first randomized O log n time and O m + n work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = V E with n vertices and m edges. Our algorithm is optimal with respect to time, work, and space. As a consequence we get optimal randomized EREW PRAM algorithms

An optimal EREW PRAM algorithm for minim
An optimal EREW PRAM algorithm for minimum spanning tree verification
โœ Valerie King; Chung Keung Poon; Vijaya Ramachandran; Santanu Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 661 KB

We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(logn) time and O(m + n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the proble