(1,1)-Cluster Editing is polynomial-time solvable

A graph H is a clique graph if H is a vertex-disjoin union of cliques. Abu-Khzam (2017) introduced the (a,d)-Cluster Editing problem, where for fixed natural numbers a,d, given a graph G and vertex-weights a∗:V(G)→{0,1,…,a} and d∗:V(G)→{0,1,…,d}, we are to decide whether G can be turned into a clust...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 340; pp. 259 - 271
Main Authors:	Gutin, Gregory, Yeo, Anders
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.12.2023
Subjects:	Cluster editing Polynomial algorithm Cluster editing Polynomial algorithm
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!