Algorithms for clustering data
Algorithms for clustering data
Reexamining the cluster hypothesis: scatter/gather on retrieval results
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Finding related pages in the World Wide Web
WWW '99 Proceedings of the eighth international conference on World Wide Web
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Substitution Decomposition on Chordal Graphs and Applications
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
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
Clustering with qualitative information
Journal of Computer and System Sciences - Special issue: Learning theory 2003
A more effective linear kernelization for cluster editing
Theoretical Computer Science
Going weighted: Parameterized algorithms 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
The cluster editing problem: implementations and experiments
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The lost continent of polynomial time: preprocessing and kernelization
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
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 |
The cluster editing problem is a decision problem that, for a graph G and a parameter k, determines if one can apply at most k edge insertion/deletion operations on G so that the resulting graph becomes a union of disjoint cliques. The problem has attracted much attention because of its applications in a variety of areas. In this paper, we present a polynomial-time kernelization algorithm for the problem that produces a kernel of size bounded by 2k. More precisely, we develop an O(mn)-time algorithm that, on a graph G of n vertices and m edges and a parameter k, produces a graph G^' and a parameter k^' such that k^'=