A 2k kernel for the cluster editing problem
From MaRDI portal
A \(2k\) kernel for the cluster editing problem
Recommendations
Cites work
- A more effective linear kernelization for cluster editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Clustering with qualitative information
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Correlation clustering
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Efficient Parameterized Preprocessing for Cluster Editing
- Going weighted: parameterized algorithms for cluster editing
- Graph-modeled data clustering: Exact algorithms for clique generation
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- The Cluster Editing Problem: Implementations and Experiments
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
Cited in
(58)- A more effective linear kernelization for cluster editing
- A (3+)k-vertex kernel for edge-disjoint triangle packing
- Cluster editing: kernelization based on edge cuts
- A golden ratio parameterized algorithm for cluster editing
- A simple and improved parameterized algorithm for bicluster editing
- (Sub)linear kernels for edge modification problems toward structured graph classes
- A new temporal interpretation of cluster editing
- Parameterized dynamic cluster editing
- Kernels for packing and covering problems
- On the complexity of multi-parameterized cluster editing
- Parameterized algorithms for min-max 2-cluster editing
- A cubic-vertex kernel for flip consensus tree
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- A fast branching algorithm for cluster vertex deletion
- Kernel for \(K_t\)\textsc-free Edge Deletion
- On Editing Graphs into 2-Club Clusters
- Cluster editing: kernelization based on edge cuts
- Editing graphs into few cliques: complexity, approximation, and kernelization schemes
- A \(2k\) kernel for the cluster editing problem
- A More Effective Linear Kernelization for Cluster Editing
- On making directed graphs transitive
- Kernelization and parameterized complexity of star editing and union editing
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- A faster algorithm for the cluster editing problem on proper interval graphs
- Parameterized Dynamic Cluster Editing
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- Cluster editing
- Efficient Parameterized Preprocessing for Cluster Editing
- Fast FPT-Algorithms for Cleaning Grids
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- \((1,1)\)-cluster editing is polynomial-time solvable
- A survey of parameterized algorithms and the complexity of edge modification
- On the parameterized complexity of s-club cluster deletion problems
- On the parameterized complexity of \(s\)-club cluster deletion problems
- Asymptotic bounds for clustering problems in random graphs
- A new temporal interpretation of cluster editing
- A quasi-quadratic vertex-kernel for cograph edge editing
- Cluster editing for multi-layer and temporal graphs
- Improved kernelization and fixed-parameter algorithms for bicluster editing
- A heuristic algorithm for the cluster editing problem
- Bicluster editing with overlaps: a vertex splitting approach
- Algorithms and hardness results for the (k, )-cover problem
- Correlation clustering with vertex splitting
- Polynomial formulations as a barrier for reduction-based hardness proofs
- Smaller kernels for 3-leaf power modifications problems
- Graph clustering problems under the Lens of parameterized local search
- Parameterized complexity of weighted target set selection
- Applying a cut-based data reduction rule for weighted cluster editing in polynomial time
- Cluster editing with vertex splitting
- Cluster editing parameterized above modification-disjoint P₃-packings
- Cluster editing with locally bounded modifications
- Triangle-covered graphs: algorithms, complexity, and structure
- Cluster editing parameterized above modification-disjoint P₃-Packings
- Correcting a graph into a linegraph minimizing Hamming distance edition is NP-complete and FPT by treewidth
- Graph clustering problems under the Lens of parameterized local search
- Cluster editing on cographs and related classes
- Obtaining split graphs by edge contraction
- Sufficient conditions for edit-optimal clusters
This page was built for publication: A \(2k\) kernel for the cluster editing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414871)
