A note on the Split to Block Vertex Deletion problem.

Research output: Contribution to journalArticle

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).
Original languageEnglish
JournalArxiv preprint
Issue number 1906.10012 [cs.DS]
StatePublished - 2019

Fingerprint

Dive into the research topics of 'A note on the Split to Block Vertex Deletion problem.'. Together they form a unique fingerprint.

Cite this