Editing graphs into disjoint unions of dense clusters

DOI10.1007/s00453-011-9487-4zbMath1230.68091MaRDI QIDQ652530

Jiong Guo, Christian Komusiewicz, Johannes Uhlmann, Iyad A. Kanj

Publication date: 14 December 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9487-4

zbMATH Keywords

data reduction; NP-hardness; cluster editing; parameterized complexity; clique relaxations; forbidden subgraph characterization

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)