On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic [chapter]

Stephan Kreutzer, Siamak Tazari
2010 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms  
Brambles were introduced as the dual notion to treewidth, one of the most central concepts of the graph minor theory of Robertson and Seymour. Recently, Grohe and Marx showed that there are graphs G, in which every bramble of order larger than the square root of the treewidth is of exponential size in |G|. On the positive side, they show the existence of polynomialsized brambles of the order of the square root of the treewidth, up to log factors. We provide the first polynomial time algorithm
more » ... construct a bramble in general graphs and achieve this bound, up to log-factors. We use this algorithm to construct grid-like minors, a replacement structure for grid-minors recently introduced by Reed and Wood, in polynomial time. Using the gridlike minors, we introduce the notion of a perfect bramble and an algorithm to find one in polynomial time. Perfect brambles are brambles with a particularly simple structure and they also provide us with a subgraph that has bounded degree and still large treewidth; we use them to obtain a meta-theorem on deciding certain parameterized subgraph-closed problems on general graphs in time singly exponential in the parameter; the only other result with a similar flavor that is known to us is due to Demaine and Hajiaghayi and obtains a doubly-exponential bound on the parameter (albeit, for a more general class of parameterized problems). The second part of our work deals with providing a lower bound to Courcelle's famous theorem from almost two decades ago, stating that every graph property that can be expressed by a sentence in monadic second-order logic (MSO), can be decided by a linear time algorithm on classes of graphs of bounded treewidth. Whereas much work has been done on designing, improving, and applying algorithms on graphs of bounded treewidth, not much is known on the side of lower bounds: what bound on the treewidth of a class of graphs "forbids" polynomial-time parameterized algorithms to decide MSO-sentences? This question has only recently received attention with the first systematic study appearing in [Kreutzer 2009 ]. Using our re-sults from the first part of our work we can improve on it significantly and establish a strong lower bound for Courcelle's theorem on classes of colored graphs. 354 Lemma 3.2. (Grohe and Marx [25]) If |W | = 2k + 1 and W has no 1 2 -balanced separator of size k in a graph G, then α W (G) ≥ 1 4k+1 .
doi:10.1137/1.9781611973075.30 dblp:conf/soda/KreutzerT10 fatcat:udgkaapsynhqlpbm5pg3vfqdxy