Parameterized vertex deletion problems for hereditary graph classes with a block property
Bonnet, Édouard and Brettel, Nick and Kwon, Ojoung 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. 233244. ISSN 03029743 10.1007/9783662535363_20

Text
Bonnet_233_3174145_ny.pdf Download (706kB)  Preview 
Abstract
For a class of graphs P, the Bounded PBlock 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 PBlock 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 PBlock Vertex Deletion admits a cknO(1)time algorithm for some constant c independent of d. We also show that Bounded PBlock Vertex Deletion admits a kernel with O(k2d7) vertices. © SpringerVerlag GmbH Germany 2016.
Item Type:  Article 

Uncontrolled Keywords:  Graph theory; Vertex deletion problems; Time algorithms; Positive integers; Polynomialtime; Hereditary property; Exponential time hypothesis; Complete graphs; Block properties; Polynomial approximation 
Subjects:  Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány 
Divisions:  Informatics Laboratory 
SWORD Depositor:  MTMT Injector 
Depositing User:  MTMT Injector 
Date Deposited:  29 Jan 2017 20:33 
Last Modified:  21 Jul 2019 14:03 
URI:  https://eprints.sztaki.hu/id/eprint/9042 
Update Item 