Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Cluster analysis and mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Clustering Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Transactions on Pattern Analysis and Machine Intelligence
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Center CLICK: A Clustering Algorithm with Applications to Gene Expression Analysis
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Cluster Graph Modification Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Graphs and Hypergraphs
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Proceedings of the 16th international conference on World Wide Web
Approximation algorithms for co-clustering
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Clustering with Partial Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Going Weighted: Parameterized Algorithms for Cluster Editing
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A Local-Search 2-Approximation for 2-Correlation-Clustering
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
A more effective linear kernelization for cluster editing
Theoretical Computer Science
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Graph-Based Data Clustering with Overlaps
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Hardness of edge-modification problems
Theoretical Computer Science
Going weighted: Parameterized algorithms for cluster editing
Theoretical Computer Science
Editing Graphs into Disjoint Unions of Dense Clusters
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Clustering with partial information
Theoretical Computer Science
Exact algorithms for cluster editing: evaluation and experiments
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Improved algorithms for bicluster editing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Fast and accurate alignment of multiple protein networks
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Cluster editing problem for points on the real line: A polynomial time algorithm
Information Processing Letters
Polynomial kernels for 3-leaf power graph modification problems
Discrete Applied Mathematics
A 2k Kernel for the cluster editing problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Generalized graph clustering: recognizing (p, q)-cluster graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Alternative parameterizations for cluster editing
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Even faster parameterized cluster deletion and cluster editing
Information Processing Letters
Hardness of subgraph and supergraph problems in c-tournaments
Theoretical Computer Science
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Automated segmentation of DNA sequences with complex evolutionary histories
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
A 2k kernel for the cluster editing problem
Journal of Computer and System Sciences
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
On making directed graphs transitive
Journal of Computer and System Sciences
Kernelization through tidying: a case study based on s-plex cluster vertex deletion
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Extending the tractability border for closest leaf powers
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Applying modular decomposition to parameterized bicluster editing
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On the parameterized complexity of consensus clustering
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Graph-based data clustering with overlaps
Discrete Optimization
On editing graphs into 2-club clusters
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
A more effective linear kernelization for Cluster Editing
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A characterisation of the complexity of forbidding subproblems in binary Max-CSP
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
Hi-index | 0.01 |
In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets. From a graph theoretic point of view, a cluster graph is a vertex-disjoint union of cliques. The clustering problem is the task of making the fewest changes to the edge set of an input graph so that it becomes a cluster graph. We study the complexity of three variants of the problem. In the Cluster Completion variant edges can only be added. In Cluster Deletion, edges can only be deleted. In Cluster Editing, both edge additions and edge deletions are allowed. We also study these variants when the desired solution must contain a prespecified number of clusters. We show that Cluster Editing is NP-complete, Cluster Deletion is NP-hard to approximate to within some constant factor, and Cluster Completion is polynomial. When the desired solution must contain exactly p clusters, we show that Cluster Editing is NP-complete for every p ≥ 2; Cluster Deletion is polynomial for p = 2 but NP-complete for p 2; and Cluster Completion is polynomial for any p. We also give a constant factor approximation algorithm for a variant of Cluster Editing when p = 2.