Finding Connected Components in O(log n log log n) Time on the EREW PRAM.

Ka Wong Chong Tak Wah Lam

Published in: SODA (1993)

Keyphrases

connected components
binary images
parallel algorithm
worst case
log log
lower bound
level set
graph mining
image analysis
multiresolution
text lines
watershed transformation
real world graphs
connected component analysis
grey levels