NP-hard problems in hierarchical-tree clustering
Acta Informatica
A cutting plane algorithm for a clustering problem
Mathematical Programming: Series A and B
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
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
A more effective linear kernelization for cluster editing
Theoretical Computer Science
Deterministic algorithms for rank aggregation and other ranking and clustering problems
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Exact algorithms for cluster editing: evaluation and experiments
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
The cluster editing problem: implementations and experiments
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
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
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
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
A golden ratio parameterized algorithm for cluster editing
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Graph-based data clustering with overlaps
Discrete Optimization
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
A golden ratio parameterized algorithm for Cluster Editing
Journal of Discrete Algorithms
Partitioning into colorful components by minimum edge deletions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
European Journal of Combinatorics
| Hi-index | 5.23 |
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem is NP-complete but recently, several parameterized algorithms have been proposed. In this paper, we present a number of surprisingly simple search tree algorithms for Weighted Cluster Editing assuming that edge insertion and deletion costs are positive integers. We show that the smallest search tree has size O(1.82^k) for edit cost k, resulting in the currently fastest parameterized algorithm, both for this problem and its unweighted counterpart. We have implemented and compared our algorithms, and achieved promising results.