How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
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.
Unable to display preview. Download preview PDF.
- 5.D.G. Corneil and U. Rotics. On the relationship between clique-width and treewidth. In Proceedings of Graph-Theoretical Concepts in Computer Science, LNCS, Springer-Verlag, 2001. to appearGoogle Scholar
- 10.D. Kobler and U. Rotics. Polynomial algorithms for partitioning problems on graphs with fixed clique-width. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 468–476 ACM-SIAM, 2001.Google Scholar