A new class of parallel algorithms for finding connected components on machines with bit-vector operations
From MaRDI portal
(Redirected from Publication:1328526)
Recommendations
Cites work
- scientific article; zbMATH DE number 3530974 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 3576688 (Why is no real title available?)
- An O(logn) parallel connectivity algorithm
- Computing connected components on parallel computers
- Efficient parallel algorithms for some graph problems
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
- Parallel Computations in Graph Theory
- Parallel algorithms for the connected components and minimal spanning tree problems
- Parallel computation and conflicts in memory access
Cited in
(8)- scientific article; zbMATH DE number 1751891 (Why is no real title available?)
- Finding Connected Components in O(log n log log n) Time on the EREW PRAM
- scientific article; zbMATH DE number 437524 (Why is no real title available?)
- Formal proof of prefix adders
- Parallel algorithms for finding connected components of a graph
- scientific article; zbMATH DE number 1844551 (Why is no real title available?)
- A generalized parallel prefix sums algorithm for arbitrary size arrays
- Formal proof of integer adders using all-prefix-sums operation
This page was built for publication: A new class of parallel algorithms for finding connected components on machines with bit-vector operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328526)
