Login / Signup

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

Ka Wong ChongTak Wah Lam
Published in: J. Algorithms (1995)
Keyphrases
  • connected components
  • binary images
  • parallel algorithm
  • lower bound
  • log log
  • worst case
  • level set
  • graph mining
  • level lines
  • real world
  • social networks