Algorithms for deletion problems on split graphs

Dekel Tsur

doi:10.1016/j.ipl.2020.106066

Algorithms for deletion problems on split graphs

Dekel Tsur

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

In the SPLIT TO BLOCK VERTEX DELETION and SPLIT TO THRESHOLD VERTEX DELETION problems the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of vertices of size at most k such that G−S is a block graph and G−S is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are O^⁎(2.076^k) and O^⁎(1.619^k), respectively.

Original language	English
Article number	106066
Journal	Information Processing Letters
Volume	167
DOIs	https://doi.org/10.1016/j.ipl.2020.106066
State	Published - 1 Apr 2021

Keywords

Graph algorithms
Parameterized complexity
Split graphs

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2020.106066

Cite this

@article{3f174018eeb2475cb26d279fd94acee1,

title = "Algorithms for deletion problems on split graphs",

abstract = "In the SPLIT TO BLOCK VERTEX DELETION and SPLIT TO THRESHOLD VERTEX DELETION problems the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of vertices of size at most k such that G−S is a block graph and G−S is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are O⁎(2.076k) and O⁎(1.619k), respectively.",

keywords = "Graph algorithms, Parameterized complexity, Split graphs",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2021",

month = apr,

day = "1",

doi = "10.1016/j.ipl.2020.106066",

language = "English",

volume = "167",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Algorithms for deletion problems on split graphs

AU - Tsur, Dekel

PY - 2021/4/1

Y1 - 2021/4/1

N2 - In the SPLIT TO BLOCK VERTEX DELETION and SPLIT TO THRESHOLD VERTEX DELETION problems the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of vertices of size at most k such that G−S is a block graph and G−S is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are O⁎(2.076k) and O⁎(1.619k), respectively.

AB - In the SPLIT TO BLOCK VERTEX DELETION and SPLIT TO THRESHOLD VERTEX DELETION problems the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of vertices of size at most k such that G−S is a block graph and G−S is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are O⁎(2.076k) and O⁎(1.619k), respectively.

KW - Graph algorithms

KW - Parameterized complexity

KW - Split graphs

UR - http://www.scopus.com/inward/record.url?scp=85095786112&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2020.106066

DO - 10.1016/j.ipl.2020.106066

M3 - Article

AN - SCOPUS:85095786112

SN - 0020-0190

VL - 167

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106066

ER -

Algorithms for deletion problems on split graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this