An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
Hillel GazitPublished in: FOCS (1986)
Keyphrases
- connected components
- parallel algorithm
- binary images
- binary search trees
- graph mining
- medial axis transform
- parallel computation
- strongly connected components
- level set
- connected component analysis
- shared memory
- optimal solution
- parallel version
- undirected graph
- connected component labeling
- parallel implementations
- cluster of workstations
- real world graphs
- lower bound
- computer vision