A faster parallel connectivity algorithm on cographs (Q2371145): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.aml.2006.05.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2030620450 / rank | |||
Normal rank |
Revision as of 20:56, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A faster parallel connectivity algorithm on cographs |
scientific article |
Statements
A faster parallel connectivity algorithm on cographs (English)
0 references
29 June 2007
0 references
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)].
0 references
cographs
0 references
connectivity
0 references
parallel algorithms
0 references