Parallel Constant-Time Connectivity Algorithms on a Reconfigurable Network of Processors

Research output: Contribution to journalArticle

4 Citations (Scopus)


This short note presents constant-time algorithms for label- ing the connected components of an image on a network of processors with a wide reconfigurable bus. The algorithms are based on a processor indexing scheme which employs constant-weight codes. The use of such codes enables identifying a single representative processor for each component in a constant number of steps. The proposed algorithms can label an N x N image in 0(1) time using N2processors, which is optimal. Furthermore, the proposed techniques lead to an O(log N/log log N)-time image labeling algorithm on a network of N2 processors with a reconfigurable bus of width log N bits. It is shown that these techniques can be applied to labeling an undirected N-vertex graph represented by an adjacency matrix.

Original languageEnglish
Pages (from-to)105-110
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number1
Publication statusPublished - 1 Jan 1995
Externally publishedYes



  • array processing
  • constant-time algorithms
  • constant-weight codes
  • graphs
  • image computations
  • labeling connected components
  • parallel processing
  • Reconfigurable networks of processors

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this