Locality in computing connected components

MaRDI QIDQ4250988zbMATH OpenFDO

Authors Abhiram Ranade

Publication date 17 June 1999

zbMATH Keywords

connected componentsrandomized parallel algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• An efficient and fast parallel-connected component algorithm
• scientific article; zbMATH DE number 1057773
• Fast Connected Components Algorithms for the EREW PRAM
• scientific article; zbMATH DE number 3930349

Cited in

(4)

• Computing a representation of the local environment
• Can we locally compute sparse connected subgraphs?
• Translating submachine locality into locality of reference
• Simple concurrent labeling algorithms for connected components

This page was built for publication: Locality in computing connected components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250988)