论文信息 - A fast NC algorithm to recognize P/sub 4/-reducible graphs

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.<<ETX>>

S. Olariu | R. Lin

[1] D. Seinsche. On a property of the class of n-colorable graphs , 1974 .

[2] H. A. Jung,et al. On a class of posets and the corresponding comparability graphs , 1978, J. Comb. Theory B.

[3] S. Olariu,et al. P4‐Reducible Graphs—Class of Uniquely Tree‐Representable Graphs , 1989 .

[4] Stephan Olariu,et al. A Linear-Time Recognition Algorithm for P4-Reducible Graphs , 1989, FSTTCS.

[5] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[6] Stephan Olariu,et al. An NC Recognition Algorithm for Cographs , 1991, J. Parallel Distributed Comput..

[7] C. Savage. Parallel Algorithms for Graph Theoretic Problems , 1977 .

[8] Sartaj Sahni,et al. Parallel Scheduling Algorithms , 1983, Oper. Res..

[9] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[10] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..