Clique-width is NP-complete

SIAM Journal on Discrete Mathematics

Volumn 23, Issue 2, 2009, Pages 909-939

  Fellows, Michael R ^a   Rosamond, Frances A ^a   Rotics, Udi ^b   Szeider, Stefan ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b NETANYA ACADEMIC COLLEGE   (Israel)

^c DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Absolute approximation; Clique width; NP completeness; Pathwidth

Indexed keywords

3-COLORABILITY; CLIQUE-WIDTH; GRAPH G; GRAPH PARAMETERS; GRAPH PROBLEMS; MONADIC SECOND-ORDER LOGIC; NP COMPLETE; NP-COMPLETENESS; NP-HARD PROBLEM; PATHWIDTH; POLYNOMIAL-TIME; SECOND ORDERS; VERTEX SET;

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 73349137261     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/070687256     Document Type: Article

References (35)

1. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a κ-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
2. H. L. BODLAENDER, J. R. GILBERT, H. HAFSTEINSSON, AND T. KLOKS, Approximating tree- width, pathwidth, frontsize, and shortest elimination tree, J. Algorithms, 18 (1995), pp. 238-255.
3. R. BOLIAC AND V. LOZIN, On the clique-width of graphs in hereditary classes, in Algorithms and Computation, Lecture Notes in Comput. Sci. 2518, Springer-Verlag, Berlin, 2002, pp. 44-54.
4. A. BRANDSTÄDT, F. F. DRAGAN, H.-O. LE, AND R. MOSCA, New graph classes of bounded clique-width, Theory Comput. Syst., 38 (2005), pp. 623-645.
5. A. BRANDSTÄDT, J. ENGELFRIET, H.-O. LE, AND V. V. LOZIN, Clique-width for 4-vertex forbidden subgraphs, Theory Comput. Syst., 39 (2006), p p. 561-590.
6. D. G. CORNEIL AND U. ROTICS, On the relationship between clique-width and treewidth, SIAM J. Comput., 34 (2005), pp. 825-847.
7. An extended abstract appeared in the Proceedings of Graph-Theoretic Concepts in Computer Science (WG 2001), Lecture Notes in Comput. Sci. 2204, Springer-Verlag, Berlin, 2001, pp. 78-90.
8. D. G. CORNEIL, M. HABIB, J.-M. LANLIGNEL, B. A. REED, AND U. ROTICS, Polynomial time recognition of clique-width ≤ 3 graphs (extended abstract), in LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, G. H. Gonnet, D. Panario, and A. Viola, eds., Lecture Notes in Comput. Sci. 1776, Springer-Verlag, Berlin, 2000, pp. 126-134.
9. B. COURCELLE AND J. ENGELFRIET, A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars, Math. Systems Theory, 28 (1995), pp. 515-552.
10. B. COURCELLE AND M. MOSBAH, Monadic second-order evaluations on tree-decomposable graphs, Theoret. Comput. Sci., 109 (1993), pp. 49-82.
11. B. COURCELLE AND S. OLARIU, Upper bounds to the clique-width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
12. B. COURCELLE AND S. OUM, Vertex-minors, monadic second-order logic and a conjecture by Seese, J. Combin. Theory Ser. B, 97 (2007), pp. 91-126.
13. B. COURCELLE, J. ENGELFRIET, AND G. ROZENBERG, Context-free handle-rewriting hypergraph grammars, in Proceedings of the Graph-Grammars and Their Application to Computer Science, 4th International Workshop (Bremen, Germany, 1990), H. Ehrig, H.-J. Kreowski, and G. Rozenberg, eds., Lecture Notes in Comput. Sci. 532, Springer-Verlag, Berlin, 1991, pp. 253-268.
14. B. COURCELLE, J. ENGELFRIET, AND G. ROZENBERG, Handle-rewriting hypergraph grammars, J. Comput. System Sci., 46 (1993), pp. 218-270.
15. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33 (2000), pp. 125-150.
16. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, Discrete Appl. Math., 108 (2001), pp. 23-52.
17. W. ESPELAGE, F. GURSKI, AND E. WANKE, Deciding clique-width for graphs of bounded tree-width, J. Graph Algorithms Appl., 7 (2003), pp. 141-180.
18. M. R. FELLOWS, F. A. ROSAMOND, U. ROTICS, AND S. SZEIDER, Proving NP-Hardness for Clique-Width I: Non-approximability of Sequential Clique-Width, Technical report TR05-080, Revision 01, Electronic Colloquium on Computational Complexity, HPI, Potsdam, Germany, 2005.
19. F. V. FOMIN, P. HEGGERNES, AND J. A. TELLE, Graph searching, elimination trees, and a generalization of bandwidth, in Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 2751, Springer-Verlag, Berlin, 2003, pp. 73-85.
20. A. GLIKSON AND J. A. MAKOWSKY, NCE graph grammars and clique-width, in Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 2880, Springer-Verlag, Berlin, 2003, pp. 237-248.
21. F. GURSKI AND E. WANKE, Minimizing NLC-width is NP-complete (extended abstract), in Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 3787, Springer-Verlag, Berlin, 2005, pp. 69-80.
22. F. GURSKI AND E. WANKE, On the relationship between NLC-width and linear NLC-width, Theoret. Comput. Sci., 347 (2005), pp. 76-89.
23. F. GURSKI AND E. WANKE, Vertex disjoint paths on clique-width bounded graphs, Theoret. Comput. Sci., 359 (2006), pp. 188-199.
24. Ö. JOHANSSON, Clique-decomposition, NLC-decomposition, and modular decomposition - Relationships and results for random graphs, Congr. Numer., 132 (1998), pp. 39-60.
25. M. KARPINSKI AND J. WIRTGEN, On Approximation Hardness of the Bandwidth Problem, Technical report TR97-041, ECCC, Electronic Colloquium on Computational Complexity, HPI, Potsdam, Germany, 1997.
26. N. G. KINNERSLEY, The vertex separation number of a graph equals its path-width, Inform. Process. Lett., 42 (1992), pp. 345-350.
27. D. KOBLER AND U. ROTICS, Edge dominating set and colorings on graphs with fixed clique- width, Discrete Appl. Math., 126 (2003), pp. 197-221.
28. V. LOZIN AND D. RAUTENBACH, Chordal bipartite graphs of bounded tree- and clique-width, Discrete Math., 283 (2004), pp. 151-158.
29. V. LOZIN AND D. RAUTENBACH, On the band-, tree-, and clique-width of graphs with bounded vertex degree, SIAM J. Discrete Math., 18 (2004), pp. 195-206.
30. 4's, Internat. J. Found. Comput. Sci., 10 (1999), pp. 329-348.
31. S. OUM, Approximating rank-width and clique-width quickly, ACM Trans. Algorithms, 5 (2008), pp. 1-20.
32. S. OUM AND P. SEYMOUR, Approximating clique-width and branch-width, J. Combin. Theory Ser. B, 96 (2006), pp. 514-528.
33. D. SEESE, The structure of the models of decidable mon adic theories of graphs, Ann. Pure Appl. Logic, 53 (1991), pp. 169-195.
34. J.-M. VANHERPE, Clique-width of partner-limited graphs, Discrete Math., 276 (2004), pp. 363-374.
35. E. WANKE, κ-NLC graphs and polynomial algorithms, Discrete Appl. Math., 54 (1994), pp. 251-266.