A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical Computer Science, Volume 263, Number 1-2, pages 99-111 - July 2001
An easy way for graphs recognition algorithms is to use a two-steps process. First compute a characteristic feature as if the graph belong to that class. Secondly check whether the computed feature really defines the input graphs. Although in some cases the two steps can be merged. But separating them may yield to new and much more easily understood algorithms. In this paper we apply that paradigm to the cographs and distance hereditary graphs recognition problem
Références BibTex
@Article{DHP2001_882,
}
| author | = {Damiand, G. and Habib, M. and Paul, C.}, | |
| title | = {A simple paradigm for graph recognition: application to cographs and distance hereditary graphs.}, | |
| journal | = {Theoretical Computer Science}, | |
| number | = {1-2}, | |
| volume | = {263}, | |
| pages | = {99-111}, | |
| month | = {July}, | |
| year | = {2001}, | |
| url | = {http://dx.doi.org/10.1016/S0304-3975(00)00234-6}, |