On Brambles, Grid-Like Minors, and Parameterized Intractability of
Monadic Second-Order Logic
release_ajfgzk6oqregpiwfrvvkec3viu
by
Stephan Kreutzer, Siamak Tazari
2009
Abstract
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 polynomial-sized brambles of the
order of the square root of the treewidth, up to log factors. We provide the
first polynomial time algorithm to 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 grid-like 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 second part of our work deals with providing a lower bound to Courcelle's
famous theorem, 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. Using our results from the
first part of our work we establish a strong lower bound for tractability of
MSO on classes of colored graphs.
In text/plain
format
Archived Files and Locations
application/pdf 253.2 kB
file_5j5bottb3vapnft44v2dvluaby
|
arxiv.org (repository) web.archive.org (webarchive) |
0907.3076v1
access all versions, variants, and formats of this works (eg, pre-prints)