Meta-kernelization with structural parameters

Kernelization is a polynomial-time algorithm that reduces an instance of a parameterized problem to a decision-equivalent instance, the kernel, whose size is bounded by a function of the parameter. In this paper we present meta-theorems that provide polynomial kernels for large classes of graph problems parameterized by a structural parameter of the input graph. Let C be an arbitrary but fixed class of graphs of bounded rank-width (or, equivalently, of bounded clique-width). We define the C -cover number of a graph to be the smallest number of modules its vertex set can be partitioned into, such that each module induces a subgraph that belongs to C . We show that each decision problem on graphs which is expressible in Monadic Second Order (MSO) logic has a polynomial kernel with a linear number of vertices when parameterized by the C -cover number. We provide similar results for MSO expressible optimization and modulo-counting problems. Kernelization meta-algorithms parameterized by structural graph parameters.Preprocessing for MSO definable decision, optimization and counting problems.Parameter based on a combination of rank-width and modular decompositions.

[1]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[2]  Michel Habib,et al.  Partitive hypergraphs , 1981, Discret. Math..

[3]  W. Cunningham.  Decomposition of Directed Graphs , 1982 .

[4]  Petr Hlinený,et al.  Finding Branch-Decompositions and Rank-Decompositions , 2007, SIAM J. Comput..

[5]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[6]  Michael R. Fellows,et al.  Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity , 2013, Eur. J. Comb..

[7]  Saket Saurabh,et al.  Kernelization - Preprocessing with a Guarantee , 2012, The Multivariate Algorithmic Revolution and Beyond.

[8]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[9]  C. Papadimitriou,et al.  Two remarks on the power of counting , 1983 .

[10]  Michael Lampis,et al.  Algorithmic Meta-theorems for Restrictions of Treewidth , 2010, Algorithmica.

[11]  Jakub Gajarský,et al.  Kernelization Using Structural Parameters on Sparse Graph Classes , 2013, ESA.

[12]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[13]  Michael R. Fellows,et al.  Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.

[14]  Michel Habib,et al.  Algorithmic aspects of a general modular decomposition theory , 2006, Discret. Appl. Math..

[15]  Mathieu Raffinot,et al.  Linear Time Split Decomposition Revisited , 2009, SIAM J. Discret. Math..

[16]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[17]  Dimitrios M. Thilikos,et al.  (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Stefan Kratsch,et al.  Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization , 2013, SIAM J. Discret. Math..

[19]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2011, J. Comput. Syst. Sci..

[20]  Fedor V. Fomin,et al.  Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[21]  Saket Saurabh,et al.  Lower bounds on kernelization , 2011, Discret. Optim..

[22]  Leslie Ann Goldberg,et al.  Counting Homomorphisms to Cactus Graphs Modulo 2 , 2014, STACS.

[23]  Robert Ganian,et al.  On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width , 2010, Discret. Appl. Math..

[24]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[25]  Leslie G. Valiant,et al.  Accidental Algorithms , 2006, FOCS.

[26]  Henning Fernau,et al.  Kernels: Annotated, Proper and Induced , 2006, IWPEC.

[27]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[28]  Michael R. Fellows,et al.  The Lost Continent of Polynomial Time: Preprocessing and Kernelization , 2006, IWPEC.

[29]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[30]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[31]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[32]  Stefan Szeider,et al.  Guarantees and limits of preprocessing in constraint satisfaction and reasoning , 2014, Artif. Intell..

[33]  Fedor V. Fomin.  Kernelization: (Invited Talk) , 2010 .

[34]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[35]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[36]  Robert Ganian,et al.  Meta-Kernelization using Well-Structured Modulators , 2015, IPEC.

[37]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[38]  Jan Arne Telle,et al.  Boolean-width of graphs , 2009, Theor. Comput. Sci..

[39]  Michael R. Fellows,et al.  Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology , 2009, IWOCA.