Cluster Deletion Revisited

Dekel Tsur

doi:10.1016/j.ipl.2021.106171

Cluster Deletion Revisited

Dekel Tsur

Department of Computer Science

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

1 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
Pages (from-to)	1-9
Number of pages	9
Journal	Information Processing Letters
Volume	173
DOIs	https://doi.org/10.1016/j.ipl.2021.106171
State	Published - 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

https://dblp.org/rec/journals/corr/abs-1907-08399

Cite this

@article{6280d6deeb4c40feb7a149d01844a9bf,

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,

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

language = "English",

volume = "173",

pages = "1--9",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

}

TY - JOUR

T1 - Cluster Deletion Revisited

AU - Tsur, Dekel

PY - 2022/1

Y1 - 2022/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 - http://www.scopus.com/inward/record.url?scp=85111242733&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2021.106171

DO - 10.1016/j.ipl.2021.106171

M3 - Article

SN - 0020-0190

VL - 173

SP - 1

EP - 9

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