Algorithmic Meta-theorems for Restrictions of Treewidth

  • Michael Lampis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6346)


Possibly the most famous algorithmic meta-theorem is Courcelle’s theorem, which states that all MSO-expressible graph properties are decidable in linear time for graphs of bounded treewidth. Unfortunately, the running time’s dependence on the formula describing the problem is in general a tower of exponentials of unbounded height, and there exist lower bounds proving that this cannot be improved even if we restrict ourselves to deciding FO logic on trees.

We investigate whether this parameter dependence can be improved by focusing on two proper subclasses of the class of bounded treewidth graphs: graphs of bounded vertex cover and graphs of bounded max-leaf number. We prove stronger algorithmic meta-theorems for these more restricted classes of graphs. More specifically, we show it is possible to decide any FO property in both of these classes with a singly exponential parameter dependence and that it is possible to decide MSO logic on graphs of bounded vertex cover with a doubly exponential parameter dependence. We also prove lower bound results which show that our upper bounds cannot be improved significantly, under widely believed complexity assumptions. Our work addresses an open problem posed by Michael Fellows.


Model Check Vertex Cover Neighborhood Diversity Model Check Problem Bound Degree Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238–249. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Inf. Comput. 85(1), 12–75 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: LICS, pp. 411–420. IEEE Computer Society, Los Alamitos (2006)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Fellows, M.R.: Open problems in parameterized complexity. In: AGAPE spring school on fixed parameter and exact algorithms (2009)Google Scholar
  8. 8.
    Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S.: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. 45(4), 822–848 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    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 2008. LNCS, vol. 5369, pp. 294–305. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    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 2007. LNCS, vol. 4497, pp. 268–277. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. J. ACM 48(6), 1184–1206 (2001)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130(1-3), 3–31 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Grohe, M.: Logic, graphs, and algorithms. Electronic Colloquium on Computational Complexity (ECCC) 14(091) (2007)Google Scholar
  15. 15.
    Hlinený, P., il Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326–362 (2008)CrossRefGoogle Scholar
  16. 16.
    Kleitman, D., West, D.: Spanning trees with many leaves. SIAM Journal on Discrete Mathematics 4, 99 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Kreutzer, S., Tazari, S.: On brambles, grid-like minors, and parameterized intractability of monadic second order logic. In: SODA (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Michael Lampis
    • 1
  1. 1.Computer Science Department, Graduate CenterCity University of New York 

Personalised recommendations