Efficient parallel recognition algorithms of cographs and distance hereditary graphs

Efficient parallel recognition algorithms of cographs and distance hereditary graphs

0.00 Avg rating—0 Votes
Article ID: iaor1996981
Country: Netherlands
Volume: 57
Issue: 1
Start Page Number: 29
End Page Number: 44
Publication Date: Feb 1995
Journal: Discrete Applied Mathematics
Authors:
Keywords: graphs
Abstract:

A parallel algorithm to recognize cographs with a linear processor bound and a log2n time bound is presented. This result extends the result of Adhar and Peng. Moreover, the paper gets a better time processor product than the algorithm of Lin and Olariu. As a consequence distance hereditary graphs can be recognized by the same processor and time bound.

Reviews

Required fields are marked *. Your email address will not be published.