Cluster Editing with Vertex Splitting

Cluster Editing, also known as Correlation Clustering, is a well-studied graph modification problem. In this problem, one is given a graph and the task is to perform up to k edge additions or deletions to transform it into a cluster graph, i.e., a graph consisting of a disjoint union of cliques. In...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 371; pp. 185 - 195
Main Authors:	Abu-Khzam, Faisal N., Arrighi, Emmanuel, Bentert, Matthias, Drange, Pål Grønås, Egan, Judith, Gaspers, Serge, Shaw, Alexis, Shaw, Peter, Sullivan, Blair D., Wolf, Petra
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.08.2025
Subjects:	Cluster Editing Graph modification Kernelization NP-hardness Parameterized algorithms Vertex Splitting NP-hardness Vertex Splitting Parameterized algorithms Graph modification Cluster Editing Kernelization
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!