@article{e1e01668932343cfad2f4fdeee0365b1,
title = "A note on the Split to Block Vertex Deletion problem.",
abstract = "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.076k). ",
author = "Dekel Tsur",
note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",
year = "2019",
language = "???core.languages.en_GB???",
journal = "arXiv preprint ",
number = " 1906.10012 [cs.DS]",
}