Deciding Clique-Width for Graphs of Bounded Tree-Width

Authors:
Wolfgang Espelage;Frank Gurski;Egon Wanke
Affiliations:
-;-;-
Venue:
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Year:
2001

Citing 9
Cited 1

The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Easy problems for tree-decomposable graphs

Journal of Algorithms
k-NLC graphs and polynomial algorithms

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
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
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science

Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k.