Algorithmic meta-theorems for restrictions of treewidth

Algorithmica

Volumn 64, Issue 1, 2012, Pages 19-37

  Lampis, Michael ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Courcelle's theorem; Max leaf number; MSO logic; Vertex cover

Indexed keywords

BOUNDED TREEWIDTH; BOUNDED-TREEWIDTH GRAPHS; COMPLEXITY ASSUMPTIONS; COURCELLE'S THEOREM; EXPONENTIALS; GRAPH PROPERTIES; LINEAR TIME; LOWER BOUNDS; MAX-LEAF NUMBER; META-THEOREMS; MSO LOGIC; PARAMETER DEPENDENCE; RUNNING TIME; TREE-WIDTH; UPPER BOUND; VERTEX COVER;

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; GRAPHIC METHODS;

GRAPH THEORY;

EID: 84861459040     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-011-9554-x     Document Type: Conference Paper

References (25)

1. S. Arnborg J. Lagergren D. Seese 1991 Easy problems for tree-decomposable graphs J. Algorithms 12 2 308 340 1105479 0734.68073 10.1016/0196-6774(91) 90006-K
2. Bodlaender, H., Fomin, F., Lokshtanov, D., Penninkx, S.S.E., Thilikos, D.: (Meta) kernelization. In: FOCS (2009)
3. Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Kralovic, R., Urzyczyn, P. (eds.) MFCS. Lecture Notes in Computer Science, vol. 4162, pp. 238-249. Springer, Berlin (2006) (Pubitemid 44577918)
4. Chen, J., Huang, X., Kanj, I.A., Xia, G.: Linear FPT reductions and computational lower bounds. In: Babai, L. (ed.) STOC, pp. 212-221. ACM, New York (2004)
5. S.S. Cosmadakis C.H. Papadimitriou 1984 The traveling salesman problem with many visits to few cities SIAM J. Comput. 13 99 731029 0529.90091 10.1137/0213007
6. B. Courcelle 1990 The monadic second-order logic of graphs. I. Recognizable sets of finite graphs Inf. Comput. 85 1 12 75 1042649 0722.03008 10.1016/0890-5401(90)90043-H (Pubitemid 20680563)
7. B. Courcelle J.A. Makowsky U. Rotics 2000 Linear time solvable optimization problems on graphs of bounded clique-width Theory Comput. Syst. 33 2 125 150 1739644 1009.68102 10.1007/s002249910009
8. Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: LICS, pp. 411-420. IEEE Comput. Soc., Los Alamitos (2006) (Pubitemid 47130387)
9. E.D. Demaine M.T. Hajiaghayi 2008 The bidimensionality theory and its algorithmic applications Comput. J. 51 3 292 302 10.1093/comjnl/bxm033 (Pubitemid 351649934)
10. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-time extremal structure I. In: Broersma, H., Johnson, M., Szeider, S. (eds.) ACiD. Texts in Algorithmics, vol. 4, pp. 1-41. King's College, London (2005)
11. Fellows, M.R.: Open problems in parameterized complexity. In: AGAPE Spring School on Fixed Parameter and Exact Algorithms (2009)
12. Fellows, M.R., Rosamond, F.A.: The complexity ecology of parameters: an illustration using bounded max leaf number. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE. Lecture Notes in Computer Science, vol. 4497, pp. 268-277. Springer, Berlin (2007)
13. Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC. Lecture Notes in Computer Science, vol. 5369, pp. 294-305. Springer, Berlin (2008)
14. M.R. Fellows D. Lokshtanov N. Misra M. Mnich F.A. Rosamond S. Saurabh 2009 The complexity ecology of parameters: an illustration using bounded max leaf number Theory Comput. Syst. 45 4 822 848 2529748 1184.05123 10.1007/s00224-009-9167-9
15. Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Clique-width: on the price of generality. In: Mathieu, C. (ed.) SODA, pp. 825-834. SIAM, Philadelphia (2009)
16. F.V. Fomin P.A. Golovach D. Lokshtanov S. Saurabh 2010 Intractability of clique-width parameterizations SIAM J. Comput. 39 5 1941 1956 2592039 1207.68161 10.1137/080742270
17. M. Frick M. Grohe 2001 Deciding first-order properties of locally tree-decomposable structures J. ACM 48 6 1184 1206 2143836
18. M. Frick M. Grohe 2004 The complexity of first-order and monadic second-order logic revisited Ann. Pure Appl. Log. 130 1-3 3 31 2092847 1062.03032 10.1016/j.apal.2004.01.007 (Pubitemid 40393343)
19. Grohe, M.: Logic, graphs, and algorithms. Electron. Colloq. Comput. Complex. (ECCC) 14(091) (2007)
20. P. Hlinený S.-i. Oum D. Seese G. Gottlob 2008 Width parameters beyond tree-width and their applications Comput. J. 51 3 326 362 10.1093/comjnl/bxm052 (Pubitemid 351649936)
21. Immerman, N.: Descriptive Complexity. Springer, Berlin (1999)
22. D.J. Kleitman D.B. West 1991 Spanning trees with many leaves SIAM J. Discrete Math. 4 99 1090293 0734.05041 10.1137/0404010
23. Kreutzer, S., Tazari, S.: On brambles, grid-like minors, and parameterized intractability of monadic second order logic. In: SODA (2010)
24. Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 538-548 (1983) (Pubitemid 14490611)
25. Robertson, N., Seymour, P.D.: Graph minors. I-XXIII. J. Comb. Theory, Ser. B (1983-2004)