Algorithmic lower bounds for problems parameterized by clique-width

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 493-502

  Fomin, Fedor V ^a   Golovach, Petr A ^a   Lokshtanov, Daniel ^a   Saurabh, Saket ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; FORESTRY; HAMILTONIANS; PARAMETERIZATION; TREES (MATHEMATICS);

ARBITRARY FUNCTIONS; BEST-KNOWN ALGORITHMS; DECISION PROBLEMS; EDGE DOMINATING SET; EXPONENTIAL TIME HYPOTHESIS; LINEAR FPT-REDUCTIONS; MONADIC SECOND-ORDER LOGIC; STRUCTURE-PRESERVING;

PARAMETER ESTIMATION;

EID: 77951699018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.42     Document Type: Conference Paper

References (29)

1. H. BODLAENDER, D. LOKSHTANOV, AND E.PENNINKX, Planar capacitated dominating set is W[1]-hard, in IWPEC'09, 2009.
2. J. CHEN, X. HUANG, I. A. KANJ, AND G. XIA, On the computational hardness based on linear FPT-redudions, J. Comb. Optim., 11 (2006), pp. 231-247.
3. -, Strong computational lower bounds via parameterized complexity, J. Comput. Syst. Sci., 72 (2006), pp. 1346-1367.
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), in LATIN'00, vol. 1776 of LNCS, Springer, 2000, pp. 126-134.
5. 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.
6. B. COURCELLE AND S. OLARIU, Upper bounds to the clique width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
7. R. G. DOWNEY, V. ESTIVILL-CASTRO, M. R. FELLOWS, E. PRIETO, AND F. A. ROSAMOND, Cutting up is hard to do: the parameterized complexity of k-cut and related problems, Electr. Notes Theor. Comput. Sci., 78 (2003).
8. R. G. DOWNEY AND M. R. FELLOWS, Parameterized complexity, Monographs in Computer Science, Springer-Verlag, New York, 1999.
9. W. ESPELAGE, F. GURSKI, AND E. WANKE, How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time, in WG'01, vol. 2204 of LNCS, Springer, 2001, pp. 117-128.
10. M. R. FELLOWS, F. A. ROSAMOND, U. ROTICS, AND S, SZEIDER, Clique-width minimization is NP-hard (extended abstract), in STOC'06, ACM, 2006, pp. 354-362.
11. J. FLUM AND M. GROHE, Parameterized complexity theory, Texts in Theoretical Computer Science. An EATCS Series, Springer-Verlag, Berlin, 2006.
12. F. V, FOMIN, P. A, GOLOVACH, D. LOKSHTANOV, AND S. SAURABH, Clique-width: on the price of generality, in SODA, 2009, pp. 825-834.
13. F. V. FOMIN, S.-IL OUM, AND D. M. THILIKOS, Rank-width and tree-width of H-minor-free graphs, Manuscript, (2008).
14. 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.
15. O. GIMÉNEZ, P. HLINENÝ, AND M. NOY, Computing the tutte polynomial on graphs of bounded clique-width, SIAM J. Discret. Math., 20 (2006).
16. B. GODLIN, T. KOTEK, AND J. A. MAKOWSKY, Evaluations of graph polynomials, in WG, vol. 5344 of Lecture Notes in Computer Science, 2008, pp. 183-194.
17. n,n, in WG'00, LNCS, Springer, 2000, pp. 196-205.
18. P. HLINENÝ AND S. IL OUM, Finding branch-decompositions and rank-decompositions, SIAM J. Comput., 38 (2008), pp. 1012-1032.
19. P. HLINENÝ, S.-IL OUM, D. SEESE, AND G. GOTTLOB, Width parameters beyond tree-width and their applications, Comput. J., 51 (2008), pp. 326-362.
20. R. IMPAGLIAZZO, R. PATURI, AND F. ZANE, Which problems have strongly exponential complexity?, J. Comput. Syst. Sci., 63 (2001), pp. 512-530.
21. D. KOBLER AND U. ROTICS, Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract), in SODA'01, ACM-SIAM, 2001, pp. 468-476.
22. -, Edge dominating set and colorings on graphs with fixed clique-width, Discrete Appl. Math., 126 (2003), pp. 197-221.
23. J. MAKOWSKY, U. ROTICS, I. AVERBOUCH, AND B. GODLIN, Computing graph polynomials on graphs of bounded clique-width, in WG'06, LNCS, Springer, 2006, pp. 191-204.
24. D. MARX, Can you beat treewidth?, in FOCS, 2007, pp. 169-179.
25. -, On the optimality of planar and geometric approximation schemes, in FOCS, 2007, pp. 338-348.
26. S.-IL OUM AND P. SEYMOUR, Approximating clique-width and branch-width, J. Combin. Theory Ser. B, 96 (2006), pp. 514-528.
27. M. RAO, MSOL partitioning problems on graphs of bounded treewidth and clique-width, Theoret. Comput. Sci., 377 (2007), pp. 260-267.
28. K. SUCHAN AND I. TODINCA, On powers of graphs of bounded NLC-width (clique-width), Discrete Appl. Math., 155 (2007), pp. 1885-1893. (Pubitemid 47212512)
29. E. WANKE, k-NLC graphs and polynomial algorithms, Discrete Appl. Math., 54 (1994), pp. 251-266.