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

DOI10.1080/00207729008910539zbMath0732.68049OpenAlexW2055429656MaRDI QIDQ3358233

Sujit Dey, Pradip K. Srimani

Publication date: 1990

Published in: International Journal of Systems Science (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)

Cites Work

• Parallel algorithms for the connected components and minimal spanning tree problems
• Parallel computation and conflicts in memory access
• VLSI Algorithms for the Connected Component Problem
• New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
• Computing connected components on parallel computers
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• 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
• The ILLIAC IV Computer

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