Structural Parameterization of Cluster Deletion

In the Weighted Cluster Deletion problem we are given a graph with non-negative integral edge weights and the task is to determine, for a target value k , if there is a set of edges of total weight at most k such that its removal results in a disjoint union of cliques. It is well-known that the prob...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 87; číslo 6; s. 961 - 981
Hlavní autoři:	Italiano, Giuseppe F., Konstantinidis, Athanasios L., Papadopoulos, Charis
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2025 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Clusters Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Mathematics of Computing Neighborhoods Parameterization Parameters Theory of Computation FPT algorithm Twin cover number Neighborhood diversity Vertex cover number Cluster deletion problem
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!