Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'

A proof of correctness is presented for the connected-components algorithm. In addition, the authors present a modified implementation of the PARALLELFCS algorithm, which finds a fundamental cycle set of a connected graph. Analyzing the processor-(time)/sup 2/ complexity, it is shown that the modified version has a better performance because it is optimally scalable to a larger number of processors.<
>