Algorithmic Meta-theorems for Restrictions of Treewidth

12 years 10 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. 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...
Michael Lampis
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2010
Where ESA
Authors Michael Lampis
Comments (0)