New fast parallel algorithm for the connected component problem and its VLSI implementation
DOI10.1080/00207729008910539zbMATH Open0732.68049OpenAlexW2055429656MaRDI QIDQ3358233FDOQ3358233
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
Recommendations
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 computation and conflicts in memory access
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
- An O(logn) parallel connectivity algorithm
- The ILLIAC IV Computer
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- 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
- 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
- Title not available (Why is that?)
- An efficient and fast parallel-connected component algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
