Work-efficient parallel union-find with applications to incremental graph connectivity
From MaRDI portal
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)
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)