Cluster deletion revisited

Dekel Tsur

doi:10.1016/j.ipl.2021.106171

Cluster deletion revisited

Dekel Tsur

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

12 Scopus citations

Abstract

In the CLUSTER DELETION problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges whose removal from G results in a graph in which every connected component is a clique. In this paper we give an algorithm for CLUSTER DELETION whose running time is O^⁎(1.404^k).

Original language	English
Article number	106171
Journal	Information Processing Letters
Volume	173
DOIs	https://doi.org/10.1016/j.ipl.2021.106171
State	Published - 1 Jan 2022

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2021.106171

Cite this

@article{9a476a9615504ead99015ff0c31fa1a4,

title = "Cluster deletion revisited",

abstract = "In the CLUSTER DELETION problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges whose removal from G results in a graph in which every connected component is a clique. In this paper we give an algorithm for CLUSTER DELETION whose running time is O⁎(1.404k).",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

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

year = "2022",

month = jan,

day = "1",

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

language = "English",

volume = "173",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Cluster deletion revisited

AU - Tsur, Dekel

PY - 2022/1/1

Y1 - 2022/1/1

N2 - In the CLUSTER DELETION problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges whose removal from G results in a graph in which every connected component is a clique. In this paper we give an algorithm for CLUSTER DELETION whose running time is O⁎(1.404k).

AB - In the CLUSTER DELETION problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges whose removal from G results in a graph in which every connected component is a clique. In this paper we give an algorithm for CLUSTER DELETION whose running time is O⁎(1.404k).

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - https://www.scopus.com/pages/publications/85111242733

U2 - 10.1016/j.ipl.2021.106171

DO - 10.1016/j.ipl.2021.106171

M3 - Article

AN - SCOPUS:85111242733

SN - 0020-0190

VL - 173

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106171

ER -

Cluster deletion revisited

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this