### Large induced subgraphs via triangulations and CMSO [article]

Fedor Fomin, Ioan Todinca, Yngve Villanger
2013 arXiv   pre-print
We obtain an algorithmic meta-theorem for the following optimization problem. Let ϕ be a Counting Monadic Second Order Logic (CMSO) formula and t be an integer. For a given graph G, the task is to maximize |X| subject to the following: there is a set of vertices F of G, containing X, such that the subgraph G[F] induced by F is of treewidth at most t, and structure (G[F],X) models ϕ. Some special cases of this optimization problem are the following generic examples. Each of these cases contains
more » ... arious problems as a special subcase: 1) "Maximum induced subgraph with at most l copies of cycles of length 0 modulo m", where for fixed nonnegative integers m and l, the task is to find a maximum induced subgraph of a given graph with at most l vertex-disjoint cycles of length 0 modulo m. 2) "Minimum Γ-deletion", where for a fixed finite set of graphs Γcontaining a planar graph, the task is to find a maximum induced subgraph of a given graph containing no graph from Γ as a minor. 3) "Independent Π-packing", where for a fixed finite set of connected graphs Π, the task is to find an induced subgraph G[F] of a given graph G with the maximum number of connected components, such that each connected component of G[F] is isomorphic to some graph from Π. We give an algorithm solving the optimization problem on an n-vertex graph G in time O(#pmc n^t+4 f(t,ϕ)), where #pmc is the number of all potential maximal cliques in G and f is a function depending of t and ϕ only. We also show how a similar running time can be obtained for the weighted version of the problem. Pipelined with known bounds on the number of potential maximal cliques, we deduce that our optimization problem can be solved in time O(1.7347^n) for arbitrary graphs, and in polynomial time for graph classes with polynomial number of minimal separators.