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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 87; no. 6; pp. 961 - 981
Main Authors:	Italiano, Giuseppe F., Konstantinidis, Athanasios L., Papadopoulos, Charis
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2025 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!