Journal
THEORETICAL COMPUTER SCIENCE
Volume 263, Issue 1-2, Pages 99-111Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0304-3975(00)00234-6
Keywords
classes of graphs; recognition algorithms; cographs; distance hereditary graphs
Categories
Ask authors/readers for more resources
An easy way for graph recognition algorithms is to use a two-step process: first, compute a characteristic feature as if the graph belongs to that class; second, check whether the computed feature really defines the input graph. Although in some cases the two steps can be merged, separating them may yield new and much more easily understood algorithms. In this paper we apply that paradigm to the cograph and distance hereditary graph recognition problems. (C) 2001 Elsevier Science BN. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available