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

DOI10.1016/0020-0255(94)90009-4zbMATH Open0822.68044OpenAlexW2046104583MaRDI QIDQ1328526FDOQ1328526

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel computation and conflicts in memory access
• 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

Cited In (3)

• Formal proof of prefix adders
• 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)