Invitation to data reduction and problem kernelization
ACM SIGACT News
Clustering with Partial Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Going Weighted: Parameterized Algorithms for Cluster Editing
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
A more effective linear kernelization for cluster editing
Theoretical Computer Science
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Graph-Based Data Clustering with Overlaps
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Making Directed Graphs Transitive
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On problems without polynomial kernels
Journal of Computer and System Sciences
Going weighted: Parameterized algorithms for cluster editing
Theoretical Computer Science
Clustering with partial information
Theoretical Computer Science
Problem kernels for NP-complete edge deletion problems: split and related graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Exact algorithms for cluster editing: evaluation and experiments
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Improved algorithms for bicluster editing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Polynomial kernels for 3-leaf power graph modification problems
Discrete Applied Mathematics
A 2k Kernel for the cluster editing problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Generalized graph clustering: recognizing (p, q)-cluster graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in 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
Cograph editing: complexity and parameterized algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
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
On making directed graphs transitive
Journal of Computer and System Sciences
Applying modular decomposition to parameterized bicluster editing
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The cluster editing problem: implementations and experiments
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
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
Complexity and parameterized algorithms for Cograph Editing
Theoretical Computer Science
A more effective linear kernelization for Cluster Editing
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
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 an efficient polynomial-time reduction to a problem kernel of size O(k3). This improves and complements previous work. Finally, we discuss further improvements on search tree sizes using computer-generated case distinctions.