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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 65; H. 2; S. 323 - 343
1. Verfasser:	Tsur, Dekel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2021 Springer Nature B.V
Schlagworte:	Algorithms Apexes Clusters Computer Science Deletion Graph theory Theory of Computation Parameterized complexity Graph algorithms
ISSN:	1432-4350, 1433-0490
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!