A new class of parallel algorithms for finding connected components on machines with bit-vector operations
From MaRDI portal
Publication:1328526
DOI10.1016/0020-0255(94)90009-4zbMath0822.68044OpenAlexW2046104583MaRDI QIDQ1328526
Publication date: 9 October 1995
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(94)90009-4
Related Items (3)
Formal proof of integer adders using all-prefix-sums operation ⋮ Formal proof of prefix adders ⋮ A generalized parallel prefix sums algorithm for arbitrary size arrays
Cites Work
- Parallel algorithms for the connected components and minimal spanning tree problems
- Parallel computation and conflicts in memory access
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
- Computing connected components on parallel computers
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Efficient parallel algorithms for some graph problems
- An O(logn) parallel connectivity algorithm
- Parallel Computations in Graph Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new class of parallel algorithms for finding connected components on machines with bit-vector operations
