Intractability of clique-width parameterizations

SIAM Journal on Computing

Volumn 39, Issue 5, 2010, Pages 1941-1956

  Fedor, Vfomin ^a   Petr, Agolovach ^b   Lokshtanov, Daniel ^a   Saurabh, Saket ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b DURHAM UNIVERSITY   (United Kingdom)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Chromatic number; Clique width; Edge domination; Hamiltonian cycle; Parameterized complexity; Tree width

Indexed keywords

CHROMATIC NUMBER; CLIQUE-WIDTH; HAMILTONIAN CYCLE; PARAMETERIZED COMPLEXITY; TREE-WIDTH;

HAMILTONIANS;

GRAPH THEORY;

EID: 77049090879     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080742270     Document Type: Article

References (30)

1. s. arnborg, j. lagergren, and d. seese, Easy problems for tree-decomposable graphs,J. Algorithms, 12 (1991), pp. 308-340.
2. H. L. BODLAENDER, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
3. H. L. BODLAENDER, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), pp. 1-45.
4. D. G. CORNEIL, M. HABIB, J.-M. LANLIGNEL, B. A. REED, AND U. ROTICS, Polynomial time recognition of clique-width ≤ 3 graphs (extended abstract), Lectures Notes in Comput. Sci. 1776, Springer, Berlin, 2000, pp. 126-134.
5. D. G. CORNEIL AND U. ROTICS, On the relationship between clique-width and treewidth,SIAM J. Comput., 34 (2005), pp. 825-847.
6. B. COURCELLE, The monadic second-order logic of graphs. III. Tree-decompositions, minors and complexity issues,RAIRO Inform.Theor. Appl., 26 (1992), pp. 257-286.
7. 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.
8. 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.
9. B. COURCELLE AND M. MOSBAH, Monadic second-order evaluations on tree-decomposable graphs, Theoret. Comput. Sci., 109 (1993), pp. 49-82.
10. B. COURCELLE AND S. OLARIU, Upper bounds to the clique width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
11. M. DOM, D. LOKSHTANOV, S. SAURABH, AND Y. VILLANGER, Capacitated domination and covering: A parameterized perspective, Lectures Not es in Comput. Sci. 5018, Springer, Berlin, 2008, pp. 78-90.
12. R. G. DOWNEY AND M. R. FELLOWS, Parameterized complexity, Monographs in Computer Science, Springer-Verlag, New York, 1999.
13. W. ESPELAGE, F. GURSKI, AND E. WANKE, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time, Lecture Notes in Comput. Sci. 2204, Springer, Berlin, 2001, pp. 117-128.
14. 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.
15. M. R. FELLOWS, F. V. FOMIN, D. LOKSHTANOV, F. A. ROSAMOND, S. SAURABH, S. SZEI-DER, AND C. THOMASSEN, On the complexity of some colorful problems parameterized by treewidth, Lecture Notes in Comput. Sci. 4616, Springer, Berlin, 2007, pp. 366-377.
16. M. R. FELLOWS, F. A. ROSAMOND, U. ROTICS, AND S. SZEIDER, Clique-width minimization is NP-hard (extended abstract), in Proceedings of t he ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 354-362.
17. J. FLUM AND M. GROHE, Parameterized complexity theory, Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag, Berlin, 2006.
18. M. U. GERBER AND D. KOBLER, Algorithms for vertex-partitioning problems on graphs with fixed clique-width, Theoret. Comput. Sci., 299 (2003), pp. 719-734.
19. O. GIMÉNEZ, P. HLINENÝ, AND M. NOY, Computing the tutte polynomial on graphs of bounded clique-width, SIAM J. Discrete Math., 20 (2006), pp. 932-946.
20. B. GODLIN,T.KOTEK, AND J. A. MAKOWSKY, Evaluations of graph polynomials, Lecture Notes in Comput. Sci. 5344, Springer, Berlin, 2008, pp. 183-194.
21. P. HLINĚNÝ AND S. OUM, Finding branch-decompositions and rank-decompositions,SIAM J. Comput., 38 (2008), pp. 1012-1032.
22. P. HLINĚNÝ, S. OUM, D. SEESE, AND G. GOTTLOB, Width parameters beyond tree-width and their applications, Comput. J., 51 (2008), pp. 326-362.
23. D. KOBLER AND U. ROTICS, Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract), in Proceedings of Symposium on Discrete Algorithms, ACM-SIAM, Philadelphia, 2001, pp. 468-476.
24. D. KOBLER AND U. ROTICS, Edge dominating set and colorings on graphs with fixed clique-width, Discrete Appl. Math., 126 (2003), pp. 197-221.
25. J. A. MAKOWSKY, U. ROTICS, I. AVERBOUCH, AND B. GODLIN, Computing graph polynomials on graphs of bounded clique-width, Lecture Notes in Comput. Sci. 4271, Springer, Berlin, 2006, pp. 191-204.
26. S. OUM, Approximating rank-width and clique-width quickly, ACM Trans. Algorithms, 5 (2008).
27. S. OUM AND P. SEYMOUR, Approximating clique-width and branch-width, J. Combin. Theory Ser. B, 96 (2006), pp. 514-528.
28. M. RAO, MSOL partitioning problems on graphs of bounded treewidth and clique-width,Theoret. Comput. Sci., 377 (2007), pp. 260-267.
29. K. SUCHAN AND I. TODINCA, On powers of graphs of bounded NLC-width (clique-width),Discrete Appl. Math., 155 (2007), pp. 1885-1893.
30. E. WANKE, k-NLC graphs and polynomial algorithms, Discrete Appl. Math., 54 (1994), pp. 251-266.