Bonnet, Édouard and Brettel, Nick and Kwon, O-joung and Marx, Dániel (2016) Parameterized vertex deletion problems for hereditary graph classes with a block property. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 9941 L. pp. 233-244. ISSN 0302-9743 10.1007/978-3-662-53536-3_20

Preview

Text Bonnet_233_3174145_ny.pdf Download (706kB) | Preview

Abstract

For a class of graphs P, the Bounded P-Block Vertex Deletion problem asks, given a graph G on n vertices and positive integers k and d, whether there is a set S of at most k vertices such that each block of G − S has at most d vertices and is in P. We show that when P satisfies a natural hereditary property and is recognizable in polynomial time, Bounded P-Block Vertex Deletion can be solved in time 2O(k log d)nO(1), and this running time cannot be improved to 2o(k log d)nO(1), in general, unless the Exponential Time Hypothesis fails. On the other hand, if P consists of only complete graphs, or only K1,K2, and cycle graphs, then Bounded P-Block Vertex Deletion admits a cknO(1)-time algorithm for some constant c independent of d. We also show that Bounded P-Block Vertex Deletion admits a kernel with O(k2d7) vertices. © Springer-Verlag GmbH Germany 2016.

Update Item