NP-hard problems in hierarchical-tree clustering
Acta Informatica
Machine Learning
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Theory of Computing Systems
Applying Modular Decomposition to Parameterized Cluster Editing Problems
Theory of Computing Systems
A more effective linear kernelization for cluster editing
Theoretical Computer Science
Graph-Based Data Clustering with Overlaps
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Going weighted: Parameterized algorithms for cluster editing
Theoretical Computer Science
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Theory of Computing Systems
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
A 2k Kernel for the cluster editing problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
The cluster editing problem: implementations and experiments
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
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
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
A golden ratio parameterized algorithm for Cluster Editing
Journal of Discrete Algorithms
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Given an undirected graph G and a nonnegative integer k, the NP-hard CLUSTER EDITING problem asks whether G can be transformed into a disjoint union of cliques by applying at most k edge modifications. In the field of parameterized algorithmics, CLUSTER EDITING has almost exclusively been studied parameterized by the solution size k. Contrastingly, in many real-world instances it can be observed that the parameter k is not really small. This observation motivates our investigation of parameterizations of Cluster Editing different from the solution size k. Our results are as follows. CLUSTER EDITING is fixed-parameter tractable with respect to the parameter "size of a minimum cluster vertex deletion set of G", a typically much smaller parameter than k. CLUSTER EDITING remains NP-hard on graphs with maximum degree six. A restricted but practically relevant version of CLUSTER EDITING is fixed-parameter tractable with respect to the combined parameter "number of clusters in the target graph" and "maximum number of modified edges incident to any vertex in G". Many of our results also transfer to the NP-hard Cluster Deletion problem, where only edge deletions are allowed.