Regular articleAn NC recognition algorithm for cographs☆
References (29)
- et al.
Complement reducible graphs
Discrete Appl. Math.
(1981) On a class of posets and the corresponding comparability graphs
J. Combin. Theory Ser. B
(1978)On a property of the class of n-colorable graphs
J. Combin. Theory Ser. B
(1974)Implementation of simultaneous memory address access in models that forbid it
J. Algorithms
(1983)- et al.
Parallel algorithms for cograph recognition and applications
- et al.
Graph Theory with Applications
(1976) Parallel merge sort
SIAM J. Comput.
(1988)- et al.
Approximate parallel scheduling. l. The basic techniques with applications to optimal parallel list ranking in logarithmic time
SIAM J. Comput.
(1988) - et al.
Families of recursively defined perfect graphs
Cong. Numer.
(1983) - et al.
A linear recognition algorithm for cographs
SIAM J. Comput.
(1985)
Binary trees and parallel scheduling algorithms
Combinatorial problems in matrix computation
Perfect graphs and parallel algorithms
Cited by (18)
A faster parallel connectivity algorithm on cographs
2007, Applied Mathematics LettersEfficient parallel recognition of cographs
2005, Discrete Applied MathematicsParallel algorithms for P<inf>4</inf>-comparability graphs
2004, Journal of AlgorithmsParallel algorithms for Hamiltonian problems on quasi-threshold graphs
2004, Journal of Parallel and Distributed ComputingA time-optimal solution for the path cover problem on cographs
2003, Theoretical Computer ScienceRecognizing cographs and threshold graphs through a classification of their edges
2000, Information Processing Letters
- ☆
This work was supported by the National Science Foundation under Grant CCR-8909996.
Copyright © 1991 Published by Elsevier Inc.