Upper bounds to the clique width of graphs☆
Under an Elsevier user license
open archive
Keywords
Hierarchical graph decompositions
Modular decomposition
Tree decompositions
Algorithms
Monadic second-order logic
Cited by (0)
- ☆
Work supported in part by NSF grant CCR-9522093 and by ONR grant N00014-97-1-0526.
- 1
http://dept-info.labri.u-bordeaux.fr/∼courcell/ActSci.html.
Copyright © 2000 Elsevier Science B.V. All rights reserved.