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

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 65; číslo 2; s. 323 - 343
Hlavný autor:	Tsur, Dekel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2021 Springer Nature B.V
Predmet:	Algorithms Apexes Clusters Computer Science Deletion Graph theory Theory of Computation Parameterized complexity Graph algorithms
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!