A parallel algorithm to recognize P4-reducible graphs and to construct their corresponding tree representation is presented. Terminology and background are given for P4-reducible graphs and the cographs of which they are a natural generalization. The algorithm runs in O(log n) time using O((n2+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
Published in:
Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)
Date of Conference:
22-25 Oct 1990
- Page(s):
-
402
-
413
- Meeting Date :
-
22 Oct 1990-25 Oct 1990
- Print ISBN:
-
0-8186-2078-1
- INSPEC Accession Number:
-
3966547
- Conference Location :
-
Jerusalem
- Digital Object Identifier :
-
10.1109/JCIT.1990.128311
- Product Type:
-
Conference Publications