k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
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
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in 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
NLC2-Decomposition in Polynomial Time
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Journal of Parallel and Distributed Computing
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
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
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Note: Characterizations for restricted graphs of NLC-width 2
Theoretical Computer Science
Exact Algorithms for a Loading Problem with Bounded Clique Width
INFORMS Journal on Computing
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
On powers of graphs of bounded NLC-width (clique-width)
Discrete Applied Mathematics
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Polynomial algorithms for protein similarity search for restricted mRNA structures
Information Processing Letters
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Recent developments on graphs of bounded clique-width
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
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th 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
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science
Note: Computing maximum stable sets for distance-hereditary graphs
Discrete Optimization
When trees grow low: shrubs and fast MSO1
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
European Journal of Combinatorics
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics
| Hi-index | 0.01 |
We show that many non-MSO1 NP-hard graph problems can be solved in polynomial time on clique-width and NLC-width bounded graphs using a very general and simple scheme. Our examples are partition into cliques, partition into triangles, partition into complete bipartite subgraphs, partition into perfect matchings, partition into forests, cubic subgraph, Hamiltonian path, minimum maximal matching, and vertex/edge separation problems.