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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 87; H. 6; S. 961 - 981
Hauptverfasser:	Italiano, Giuseppe F., Konstantinidis, Athanasios L., Papadopoulos, Charis
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2025 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!