A new class of parallel algorithms for finding connected components on machines with bit-vector operations

DOI10.1016/0020-0255(94)90009-4MaRDI QIDQ1328526zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

undirected graph

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1057773
• Parallel algorithms for finding connected components of a graph
• An efficient and fast parallel-connected component algorithm
• scientific article; zbMATH DE number 3930349
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM

Cites work

• 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
• 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?)
• New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
• Parallel algorithms for the connected components and minimal spanning tree problems
• Parallel computation and conflicts in memory access
• Parallel Computations in Graph Theory

Cited in

(11)

• Static and dynamic parallel computation of connected components
• scientific article; zbMATH DE number 437524 (Why is no real title available?)
• New fast parallel algorithm for the connected component problem and its VLSI implementation
• Formal proof of integer adders using all-prefix-sums operation
• scientific article; zbMATH DE number 1057773 (Why is no real title available?)
• scientific article; zbMATH DE number 1751891 (Why is no real title available?)
• scientific article; zbMATH DE number 1844551 (Why is no real title available?)
• Finding Connected Components in O(log n log log n) Time on the EREW PRAM
• Parallel algorithms for finding connected components of a graph
• Formal proof of prefix adders
• A generalized parallel prefix sums algorithm for arbitrary size arrays

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)