Clique-width minimization is NP-hard

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 354-362

  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

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

ABSOLUTE APPROXIMATION; CLIQUE WIDTH; NP COMPLETENESS; PATHWIDTH;

GRAPH THEORY;

EID: 33748114479     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132568     Document Type: Conference Paper

References (33)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8(2):277-284, 1987.
2. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms, 18(2):238-255, 1995.
3. R. Boliac and V. Lozin. On the clique-width of graphs in hereditary classes. In Algorithms and computation, volume 2518 of Lecture Notes in Computer Science, pages 44-54. Springer Verlag, 2002.
4. A. Brandstädt, F. F. Dragan, H.-O. Le, and R. Mosca. New graph classes of bounded clique-width. Theory Comput. Syst., 38(5):623-645, 2005.
5. A. Brandstädt, J. Engelfriet, H.-O. Le, and V. V. Lozin. Clique-width for 4-vertex forbidden subgraphs. Theory Comput. Syst., online-first, Feb. 2006.
6. 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 G. H. Gonnet, D. Panario, and A. Viola, editors, Theoretical Informatics, 4th Latin American Symposium (LATIN 2000), volume 1776 of Lecture Notes in Computer Science, pages 126-134, 2000.
7. D. G. Corneil and U. Rotics. On the relationship between clique-width and treewidth. SIAM J. Comput. To appear. An extended abstract appeared in the Proceedings of Graph-theoretic Concepts in Computer Science (WG 2001), LNCS 2204, pp. 78-90, Springer, 2001.
8. B. Courcelle and J. Engelfriet. A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars. Math. Systems Theory, 28(6):515-552, 1995.
9. B. Courcelle, J. Engelfriet, and G. Rozenberg. Context-free handle-rewriting hypergraph grammars. In H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, Graph-Grammars and their Application to Computer Science, 4th International Workshop, Bremen, Germany, March 5-9, 1990, Proceedings, volume 532 of Lecture Notes in Computer Science, pages 253-268, 1991.
10. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. J. of Computer and System Sciences, 46(2):218-270, 1993.
11. B. Courcelle, J. A. Makowsky, and U. Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst., 33(2):125-150, 2000.
12. B. Courcelle, J. A. Makowsky, and U. Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discr. Appl. Math., 108(1-2):23-52, 2001.
13. B. Courcelle and M. Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci., 109(1-2):49-82, 1993.
14. B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discr. Appl. Math., 101(1-3):77-114, 2000.
15. B. Courcelle and S. Oum. Vertex-minors, monadic second-order logic and a conjecture by Seese. Submitted, July 2004.
16. W. Espelage, P. Gurski, and E. Wanke. Deciding clique-width for graphs of bounded tree-width. J. Graph Algorithms Appl., 7(2):141-180, 2003.
17. M. R. Fellows, F. A. Rosamond, U. Rotics, and S. Szeider. Proving NP-hardness for clique-width I: non-approximability of sequential clique-width. Electronic Colloquium on Computational Complexity, Report TR05-080, Revision 01, 2005.
18. M. R. Fellows, F. A. Rosamond, U. Rotics, and S. Szeider. Proving NP-hardness for clique-width II: non-approximability of clique-width. Electronic Colloquium on Computational Complexity, Report TR05-081, Revision 01, 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, volume 2751 of Lecture Notes in Computer Science, pages 73-85. Springer Verlag, 2003.
20. A. Glikson and J. A. Makowsky. NCE graph grammars and clique-width. In Graph-theoretic concepts in computer science, volume 2880 of Lecture Notes in Computer Science, pages 237-248. Springer Verlag, 2003.
21. F. Gurski and E. Wanke. Minimizing NLC-width is NP-complete. Extended abstract accepted for WG 2005.
22. F. Gurski and E. Wanke. Vertex disjoint paths on clique-width bounded graphs (extended abstract). In LATIN 2004: Theoretical informatics, volume 2976 of Lecture Notes in Computer Science, pages 119-128. Springer Verlag, 2004.
23. F. Gurski and E. Wanke. On the relationship between NLC-width and linear LNC-width. Theoret. Comput. Sci., to appear.
24. Ö. Johansson. Clique-decomposition, NLC-decomposition, and modular decomposition-relationships and results for random graphs. In Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998), volume 132 of Congr. Numer., pages 39-60, 1998.
25. M. Karpinski and J. Wirtgen. On approximation hardness of the bandwidth problem. Technical Report TR97-041, ECCC, Electronic Colloquium on Computational Complexity, 1997.
26. N. G. Kinnersley. The vertex separation number of a graph equals its path-width. Information Processing Letters, 42(6):345-350, 1992.
27. D. Kobler and U. Rotics. Edge dominating set and colorings on graphs with fixed clique-width. Discr. Appl. Math., 126(2-3):197-221, 2003.
28. V. Lozin and D. Rautenbach. Chordal bipartite graphs of bounded tree- and clique-width. Discrete Math., 283(1-3):151-158, 2004.
29. V. Lozin and D. Rautenbach. On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Math., 18(1):195-206, 2004.
30. S. Oum and P. Seymour. Approximating clique-width and branch-width. Submitted, Oct. 2004.
31. D. Seese. The structure of the models of decidable monadic theories of graphs. Annals of Pure and Applied Logic, 53(2):169-195, 1991.
32. J.-M. Vanherpe. Clique-width of partner-limited graphs. Discrete Math., 276(1-3):363-374, 2004.
33. E. Wanke. k-NLC graphs and polynomial algorithms. Discr. Appl. Math., 54(2-3):251-266, 1994. Efficient algorithms and partial k-trees.