Faster Parameterized Algorithm for Cluster Vertex Deletion

Dekel Tsur

doi:10.1007/s00224-020-10005-w

Faster Parameterized Algorithm for Cluster Vertex Deletion

Dekel Tsur

Department of Computer Science

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

6 Scopus citations

Abstract

In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O^∗(1.811^k).

Original language	English
Pages (from-to)	323-343
Number of pages	21
Journal	Theory of Computing Systems
Volume	65
Issue number	2
DOIs	https://doi.org/10.1007/s00224-020-10005-w
State	Published - 1 Feb 2021

Keywords

Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s00224-020-10005-w

Cite this

@article{e7b53107da474015a2a9bbe4346b6fb3,

title = "Faster Parameterized Algorithm for Cluster Vertex Deletion",

abstract = "In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O∗(1.811k).",

keywords = "Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2021",

month = feb,

day = "1",

doi = "10.1007/s00224-020-10005-w",

language = "English",

volume = "65",

pages = "323--343",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Faster Parameterized Algorithm for Cluster Vertex Deletion

AU - Tsur, Dekel

PY - 2021/2/1

Y1 - 2021/2/1

N2 - In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O∗(1.811k).

AB - In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that the deletion of the vertices of S from G results in a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is O∗(1.811k).

KW - Graph algorithms

KW - Parameterized complexity

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

U2 - 10.1007/s00224-020-10005-w

DO - 10.1007/s00224-020-10005-w

M3 - Article

AN - SCOPUS:85093974937

SN - 1432-4350

VL - 65

SP - 323

EP - 343

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 2

ER -

Faster Parameterized Algorithm for Cluster Vertex Deletion

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this