Header menu link for other important links
Quadratic Vertex Kernel for Split Vertex Deletion
A. Agrawal, S. Gupta, , R. Krithika
Published in Springer Verlag
Volume: 11485 LNCS
Pages: 1 - 12
A graph is called a split graph if its vertex set can be partitioned into a clique and an independent set. Split graphs have rich mathematical structure and interesting algorithmic properties making it one of the most well-studied special graph classes. In the Split Vertex Deletion(SVD) problem, given a graph and a positive integer k, the objective is to test whether there exists a subset of at most k vertices whose deletion results in a split graph. In this paper, we design a kernel for this problem with vertices, improving upon the previous cubic bound known. Also, by giving a simple reduction from the Vertex Cover problem, we establish that SVD does not admit a kernel with edges, for any, unless. © 2019, Springer Nature Switzerland AG.