Efficient parallel recognition algorithms of cographs and distance hereditary graphs

Elias Dahlhaus
1995 Discrete Applied Mathematics  
A parallel algorithm to recognize cographs with a linear processor bound and a log' II time bound is presented. This result extends the result of Adhar and Peng (1990). Moreover, we get a better time processor product than the algorithm of Lin and Olariu (199 I ). As a consequence distance hereditary graphs can be recognized by the same processor and time bound.
doi:10.1016/0166-218x(93)e0138-o fatcat:evlufc7abndi5fh4vlv2owxkgq