Editing Graphs into Disjoint Unions of Dense Clusters

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

Christian Komusiewicz, Johannes Uhlmann, Jiong Guo, 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 problemdense cluster graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Graph-based data clustering with overlaps ⋮ Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs

This page was built for publication: Editing Graphs into Disjoint Unions of Dense Clusters