A faster parallel connectivity algorithm on cographs (Q2371145): Difference between revisions

In this note, it is shown that the connected components of a cograph \(G\) can be optimally found in \(O(\log\log\log\Delta(G))\) time using \(O(\frac{n+m}{\log\log\log\Delta(G)})\) processors on a common CRCW PRAM, or in \(O(\log\Delta(G))\) time using \(O(\frac{n+m}{\log\Delta(G)})\) processors on an EREW PRAM, where \(n=| V(G)| \) and \(m=| E(G)| \). For further reference, see \textit{O. Berkman, Y. Matias} and \textit{P. Radge} [J. Algorithms 28, No.~2, 197--215 (1998; Zbl 0919.68072)].