A note on the Split to Block Vertex Deletion problem
share
In the Split to Block Vertex Deletion (SBVD) problem the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of at most k vertices such that G-S is a block graph. In this paper we give an algorithm for SBVD whose running time is O^*(2.076^k).
READ FULL TEXT