New fast parallel algorithm for the connected component problem and its VLSI implementation

DOI10.1080/00207729008910539MaRDI QIDQ3358233zbMATH OpenOpenAlexFDO

Authors Sujit Dey, Pradip K. Srimani

Publication date 1990

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207729008910539

zbMATH Keywords

parallel algorithmconnected component problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 3930349
• scientific article; zbMATH DE number 3860407
• An efficient and fast parallel-connected component algorithm
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations
• Solving Undirected Graph Problems on VLSI

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
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• 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
• The ILLIAC IV Computer
• VLSI Algorithms for the Connected Component Problem

Cited in

(7)

• A linear systolic algorithm for the connected component problem
• Solving Undirected Graph Problems on VLSI
• scientific article; zbMATH DE number 4131665 (Why is no real title available?)
• An efficient and fast parallel-connected component algorithm
• scientific article; zbMATH DE number 3860407 (Why is no real title available?)
• scientific article; zbMATH DE number 3858435 (Why is no real title available?)
• A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation

This page was built for publication: New fast parallel algorithm for the connected component problem and its VLSI implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358233)