Algorithms for clustering data
Algorithms for clustering data
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Cluster Graph Modification Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Substitution Decomposition on Chordal Graphs and Applications
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
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
Deterministic algorithms for rank aggregation and other ranking and clustering problems
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th 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
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
Alternative parameterizations for cluster editing
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Cograph editing: complexity and parameterized algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th 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
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
Complexity and parameterized algorithms for Cograph Editing
Theoretical Computer Science
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
| Hi-index | 0.00 |
The CLUSTERN EDITING problem for a given graph G and a given parameter k asks if one can apply at most k edge insertion/deletion operations on G so that the resulting graph is a union of disjoint cliques. The problem has attracted much attention because of its applications in bioinformatics. In this paper, we present a polynomial time kernelization algorithm for the problem that produces a kernel of size bounded by 2k, improving the previously best kernel of size 4k for the problem.