Parallel algorithms for connected components in a graph

The aim of this paper is to give new implementations of parallel algorithms for a construction of connected components of a graph As a model of parallel computation we use parallel random-access machine (PRAM). We assume that all processors share the same memory, eaeh proeessor can perform any arithmetic, Boolean or logical operations in one time unit and all instructions executed in parallel are identical (Single Instruction Stream Multiple Data Stream SIMD) Using of the o@mmon memory leads to different conflicts. There exist three models with respect to a solution of these conflicts: The exclusive read exclusive write (~REW) model at most one processor can read from or write to a given memory location at a time. It is the weakest model. The concurrent-read exclusive-write (CREW) model an arbitrary number of processors can read from a given memory location but at most one processor can write to it at a time. It is the model most frequently used. The concurrent-read concurrent-write (CRCW) model an arbitrary number of processors can read from or write to a given memory location at a time (in the latter case one processor succeeds but we do not know in advance which see [5] and ~ 9] ) It is the most powerful model~