Faster Parameterized Algorithm for Cluster Vertex Deletion

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

Full description

Saved in:
Bibliographic Details
Published in:Theory of computing systems Vol. 65; no. 2; pp. 323 - 343
Main Author: Tsur, Dekel
Format: Journal Article
Language:English
Published: New York Springer US 01.02.2021
Springer Nature B.V
Subjects:
Algorithms
Apexes
Clusters
Computer Science
Deletion
Graph theory
Theory of Computation
Parameterized complexity
Graph algorithms
ISSN:1432-4350, 1433-0490
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-020-10005-w