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

An EREW PRAM algorithm for image component labeling

โœ Scribed by Cypher, R.; Sanz, J.L.C.; Snyder, L.

Book ID
119773372
Publisher
IEEE
Year
1989
Tongue
English
Weight
656 KB
Volume
11
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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