Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
On the Relationship between Clique-Width and Treewidth
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Journal of Combinatorial Theory Series B
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Parameterized Complexity
Graph operations characterizing rank-width
Discrete Applied Mathematics
A Complete Characterisation of the Linear Clique-Width of Path Powers
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics
Hi-index | 0.00 |
The tree-width of graphs is a well-studied notion the importance of which is partly due to the fact that many hard algorithmic problems can be solved efficiently when restricted to graphs of bounded tree-width. The same is true for the clique-width which is a relatively young notion generalizing tree-width in the sense that graphs of bounded tree-width have bounded clique-width. Whereas tree-decompositions that are used to define tree-width are a very intuitive and easily visualizable way to represent the global structure of a graph, the clique-width is much harder to grasp intuitively. To better understand the nature of the clique-width, we introduce the notion of relative clique-width and study two algorithmical problems related to it. In conjunction, these problems would allow to determine the clique-width. For one of the problems, which is to determine the relative clique-width, we propose a polynomial-time factor 2 approximation algorithm and also show an exact solution in a natural special case. The study of the other problem has brought us to an alternative and transparent proof of the known fact that graphs of bounded tree-width have bounded clique-width.