Clique-width: On the price of generality

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 825-834

  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

GRAPHIC METHODS; HAMILTONIANS; PARAMETER ESTIMATION; PARAMETERIZATION; POLYNOMIAL APPROXIMATION;

BOUNDED TREEWIDTH; DECISION PROBLEMS; EDGE DOMINATING SET; FIXED-PARAMETER TRACTABLE ALGORITHMS; GLOBAL CONNECTIVITY; HAMILTONIAN CYCLE; MONADIC SECOND-ORDER LOGIC; PARAMETERIZED COMPLEXITY;

GRAPH THEORY;

EID: 70349088158     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.90     Document Type: Conference Paper

References (27)

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. (Pubitemid 126584672)
3. -, 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), in LATIN'00, vol.1776 of LNCS, Springer, 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. Théor. 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. -, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, Discrete Appl. Math., 108 (2001), pp. 23-52. International Workshop on Graph-Theoretic Concepts in Computer Science (Smolenice Castle, 1998).
9. B. COURCELLE AND S. OLARIU, Upper bounds to the clique width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
10. M. DOM, D. LOKSHTANOV, S. SAURABH, AND Y. VILLANGER, Capacitated domination and covering: A parameterized perspective, in IWPEC'08, vol.5018 of LNCS, Springer, 2008, pp. 78-90.
11. R. G. DOWNEY AND M. R. FELLOWS, Parameterized complexity, Monographs in Computer Science, Springer-Verlag, New York, 1999.
12. 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.
13. 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 (electronic).
14. M. R. FELLOWS, F. V. FOMIN, D. LOKSHTANOV, F. A. ROSAMOND, S. SAURABH, S. SZEIDER, AND C. THOMASSEN, On the complexity of some colorful problems parameterized by treewidth, in COCOA, 2007, pp. 366-377.
15. 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.
16. 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.
17. O. GIMÉNEZ, P. HLINENÝ, AND M. NOY, Computing the tutte polynomial on graphs of bounded clique-width, SIAM J. Discret. Math., 20 (2006).
18. B. GODLIN, T. KOTEK, AND J. MAKOWSKY, Evaluations of graph polynomials, in WG'08, LNCS, Springer, 2008, p. to appear.
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. (Pubitemid 351649936)
20. S. IL OUM, Approximating rank-width and clique-width quickly, ACM Trans. Algorithms, (2008), p. to appear.
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. S.-I. OUM AND P. SEYMOUR, Approximating clique-width and branch-width, J. Combin. Theory Ser. B, 96 (2006), pp. 514-528.
25. M. RAO, MSOL partitioning problems on graphs of bounded treewidth and clique-width, Theoret. Comput. Sci., 377 (2007), pp. 260-267. (Pubitemid 46670595)
26. 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)
27. E. WANKE, k-NLC graphs and polynomial algorithms, Discrete Appl. Math., 54 (1994), pp. 251-266. Efficient algorithms and partial k-trees.