Work-efficient parallel union-find with applications to incremental graph connectivity
From MaRDI portal
Publication:1693229
DOI10.1007/978-3-319-43659-3_41zbMath1377.68313OpenAlexW2533878290MaRDI QIDQ1693229
Srikanta Tirthapura, Kun-Lung Wu, Kanat Tangwongsan, Natcha Simsiri
Publication date: 11 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-43659-3_41
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (1)
This page was built for publication: Work-efficient parallel union-find with applications to incremental graph connectivity
