Work-efficient parallel union-find with applications to incremental graph connectivity

DOI10.1007/978-3-319-43659-3_41MaRDI QIDQ1693229zbMATH OpenOpenAlexFDO

Authors Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu

Publication date 11 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43659-3_41

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 3965451
• Static and dynamic parallel computation of connected components
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
• An efficient and fast parallel-connected component algorithm
• Parallel algorithms for finding connected components of a graph

Cited in

(2)

• scientific article; zbMATH DE number 7650865 (Why is no real title available?)
• scientific article; zbMATH DE number 7651141 (Why is no real title available?)

This page was built for publication: Work-efficient parallel union-find with applications to incremental graph connectivity

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