Editing Graphs into Disjoint Unions of Dense Clusters

DOI10.1007/978-3-642-10631-6_60zbMath1272.05201MaRDI QIDQ3652245

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

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_60

zbMATH Keywords

cluster editing problem; dense cluster graph

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

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