Graph theory with applications to algorithms and computer science
On n-domination, n-dependence and forbidden subgraphs
Graph theory with applications to algorithms and computer science
Easy problems for tree-decomposable graphs
Journal of Algorithms
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Selected papers of the 14th British conference on Combinatorial conference
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Proceedings of an international symposium on Graphs and combinatorics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Degree-constrained decompositions of graphs: bounded treewidth and planarity
Theoretical Computer Science
The satisfactory partition problem
Discrete Applied Mathematics
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The satisfactory partition problem
Discrete Applied Mathematics
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the Boolean-width of a graph: structure and applications
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Graphs of separability at most 2
Discrete Applied Mathematics
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
When trees grow low: shrubs and fast MSO1
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
European Journal of Combinatorics
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Theoretical Computer Science
Hi-index | 5.23 |
Many vertex-partitioning problems can be expressed within a general framework introduced by Telle and Proskurowski. They showed that optimization problems in this framework can be solved in polynomial time on classes of graphs with bounded tree-width. In this paper, we consider a very similar framework, in relationship with more general classes of graphs: we propose a polynomial time algorithm on classes of graphs with bounded clique-width for all the optimization problems in our framework. These classes of graphs are more general than the classes of graphs with bounded tree-width in the sense that classes of graphs with bounded tree-width have also bounded clique-width (but not necessarily the inverse).Our framework includes problems such as independent (dominating) set, p-dominating set, induced bounded degree subgraph, induced p-regular subgraph, perfect matching cut, graph k-coloring and graph list-k-coloring with cardinality constraints (fixed k). This paper thus provides a second (distinct) framework within which the optimization problems can be solved in polynomial time on classes of graphs with bounded clique-width, after a first framework (called MS1) due to the work of Courcelle, Makowsky and Rotics (for which they obtained a linear time algorithm).