Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width (original) (raw)
Related papers
Easy problems for tree-decomposable graphs
Journal of Algorithms, 1991
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics, 2012
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
Journal of Algorithms, 1996
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science, 2003
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition
Lecture Notes in Computer Science, 2011
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics, 2015
Discrete Applied Mathematics, 2001
Bipartitioning Problems on Graphs with Bounded Tree-Width
ArXiv, 2018
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electron. Colloquium Comput. Complex., 2005
On the xed parameter complexity of graph enumeration problems de nable in monadic second-order logic
2000
Size-Constrained Tree Decompositions
2014
A note on clique-width and tree-width for structures
2008
Journal of Computer and System Sciences, 1992
2014
Containment of Monadic Datalog Programs via Bounded Clique-Width
Lecture Notes in Computer Science, 2015
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms, 1987
On the expressive power of CNF formulas of bounded tree- and clique-width
2008
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
Lecture Notes in Computer Science, 2014
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs
Springer eBooks, 1998
Graphs of linear clique-width at most 3
Theoretical Computer Science, 2011
Computational complexity of classical problems for hereditary clique-helly graphs
Pesquisa Operacional, 2004
Constructing tree decompositions of graphs with bounded gonality
Journal of Combinatorial Optimization
Reconfiguration over Tree Decompositions
Lecture Notes in Computer Science, 2014
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics, 2008
Stoc, 1994
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal, 2007
H-Free Coloring on Graphs with Bounded Tree-Width
2019
An algorithmic metatheorem for directed treewidth
Discrete Applied Mathematics, 2015
Exploiting restricted linear structure to cope with the hardness of clique-width
2010
Faster Algorithms Parameterized by Clique-width
2013
Proving NP-hardness for clique-width II: non-approximability of clique-width
2005
On the OBDD size for graphs of bounded tree- and clique-width
Discrete Mathematics, 2009
A note on the ascending subgraph decomposition problem
Discrete Mathematics, 1990
Note a Note on the Ascending Subgraph Decomposition Problem
1990