A note on the Split to Block Vertex Deletion problem.

Dekel Tsur

A note on the Split to Block Vertex Deletion problem.

Dekel Tsur

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Working paper › Preprint

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 language	American English
State	Published - 2019

Access to Document

https://dblp.org/rec/journals/corr/abs-1906-10012

Cite this

@techreport{ff7ebcb78f15449693b33980f0989636,

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 = "American English",

type = "WorkingPaper",

}

TY - UNPB

T1 - A note on the Split to Block Vertex Deletion problem.

AU - Tsur, Dekel

N1 - 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.

PY - 2019

Y1 - 2019

N2 - 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).

AB - 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).

M3 - Preprint

BT - A note on the Split to Block Vertex Deletion problem.

ER -

A note on the Split to Block Vertex Deletion problem.

Abstract

Access to Document

Fingerprint

Cite this