Document Type

Article

Publication Date

2000

DOI

10.1016/s0166-218x(99)00184-5

Publication Title

Discrete Applied Mathematics

Volume

101

Issue

1-3

Pages

77-114

Abstract

Hierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP complete problems have linear complexity on graphs with tree-decompositions of bounded width. We investigate alternate hierarchical decompositions that apply to wider classes of graphs and still enjoy good algorithmic properties. These decompositions are motivated and inspired by the study of vertex-replacement context-free graph grammars. The complexity measure of graphs associated with these decompositions is called clique width. In this paper we bound the clique width of a graph in terms of its tree width on the one hand, and of the clique width of its edge complement on the other.

Comments

Elsevier open archive. Copyright © 2000 Elsevier Science B.V. All rights reserved.

Original Publication Citation

Courcelle, B., & Olariu, S. (2000). Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101(1-3), 77-114. doi:10.1016/s0166-218x(99)00184-5

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS