Meta-Kernelization with Structural Parameters
Journal of Computer and System Sciences(2016)
摘要
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.
更多查看译文
关键词
modular decomposition,kernelization,parameterized complexity,clique width
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络