A fast NC algorithm to recognize P/sub 4/-reducible graphs

A parallel algorithm to recognize P/sub 4/-reducible graphs and to construct their corresponding tree representation is presented. Terminology and background are given for P/sub 4/-reducible graphs and the cographs of which they are a natural generalization. The algorithm runs in O(log n) time using O((n/sup 2/+mn)/log n), where n is the number of vertices and m the number of edges, in the EREW PRAM model. Some open problems are stated.<
>