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

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete Applied Mathematics Ročník 371; s. 185 - 195
Hlavní autoři:	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
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 15.08.2025
Témata:	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
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!