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-4zbMATH Open0822.68044OpenAlexW2046104583MaRDI QIDQ1328526FDOQ1328526
Authors: V. Pereyra 
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
Recommendations
Cites Work
- Parallel computation and conflicts in memory access
- Title not available (Why is that?)
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
- An O(logn) parallel connectivity algorithm
- Parallel algorithms for the connected components and minimal spanning tree problems
- Computing connected components on parallel computers
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Efficient parallel algorithms for some graph problems
- Parallel Computations in Graph Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Finding Connected Components in O(log n log log n) Time on the EREW PRAM
- Title not available (Why is that?)
- Formal proof of prefix adders
- Parallel algorithms for finding connected components of a graph
- Title not available (Why is that?)
- 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)
