VLSI Algorithms for the Connected Component Problem
- 1 May 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (2) , 354-365
- https://doi.org/10.1137/0212023
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Fast, Efficient Parallel Algorithms for Some Graph ProblemsSIAM Journal on Computing, 1981
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel ComputerSIAM Journal on Computing, 1980
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977