Algorithms for clustering data
Algorithms for clustering data
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
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
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
Vertex cover: further observations and further improvements
Journal of Algorithms
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical 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
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Parameterized Complexity
Clustering with qualitative information
Journal of Computer and System Sciences - Special issue: Learning theory 2003
A threshold criterion, auto-detection and its use in MST-based clustering
Intelligent Data Analysis
Cluster editing problem for points on the real line: A polynomial time algorithm
Information Processing Letters
Fixed-parameter tractable generalizations of cluster editing
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the fixed-parameter enumerability of cluster editing
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Discrete Optimization
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We present efficient fixed-parameter algorithms for the NP-complete edge modification problems CLUSTER EDITING and CLUSTER DELETION. Here, the goal is to make the fewest changes to the edge set of an input graph such that the new graph is a vertex-disjoint union of cliques. Allowing up to k edge additions and deletions (CLUSTER EDITING), we solve this problem in O(2.27k + |V|3) time; allowing only up to k edge deletions (CLUSTER DELETION), we solve this problem in O(1.77k + |V|3) time. The key ingredients of our algorithms are two easy to implement bounded search tree algorithms and a reduction to a problem kernel of size O(k3). This improves and complements previous work.