A 2k kernel for the cluster editing problem
From MaRDI portal
Publication:414871
DOI10.1016/J.JCSS.2011.04.001zbMATH Open1238.68062OpenAlexW2044452930MaRDI QIDQ414871FDOQ414871
Publication date: 11 May 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2011.04.001
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Automated generation of search tree algorithms for hard graphs modification problems
- Clustering with qualitative information
- Correlation clustering
- Cluster graph modification problems
- A more effective linear kernelization for cluster editing
- Going weighted: parameterized algorithms for cluster editing
- The Cluster Editing Problem: Implementations and Experiments
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- Title not available (Why is that?)
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Efficient Parameterized Preprocessing for Cluster Editing
- Graph-modeled data clustering: Exact algorithms for clique generation
Cited In (35)
- A fast branching algorithm for cluster vertex deletion
- Cluster Editing
- Cluster editing with locally bounded modifications
- On the complexity of multi-parameterized cluster editing
- On making directed graphs transitive
- Parameterizing edge modification problems above lower bounds
- Parameterized algorithms for min-max 2-cluster editing
- Parameterized Dynamic Cluster Editing
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
- On the parameterized complexity of s-club cluster deletion problems
- On the parameterized complexity of \(s\)-club cluster deletion problems
- A new temporal interpretation of cluster editing
- A simple and improved parameterized algorithm for bicluster editing
- A cubic-vertex kernel for flip consensus tree
- A More Effective Linear Kernelization for Cluster Editing
- A golden ratio parameterized algorithm for cluster editing
- Parameterized dynamic cluster editing
- A quasi-quadratic vertex-kernel for cograph edge editing
- On Editing Graphs into 2-Club Clusters
- A survey of parameterized algorithms and the complexity of edge modification
- \((1,1)\)-cluster editing is polynomial-time solvable
- Kernel for \(K_t\)\textsc{-free Edge Deletion}
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Obtaining split graphs by edge contraction
- Asymptotic bounds for clustering problems in random graphs
- Cluster editing for multi-layer and temporal graphs
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- A new temporal interpretation of cluster editing
- Sufficient conditions for edit-optimal clusters
- Improved kernelization and fixed-parameter algorithms for bicluster 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
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
- Kernels for packing and covering problems
- (Sub)linear kernels for edge modification problems toward structured graph classes
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)
