A more effective linear kernelization for cluster editing
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational methods for problems pertaining to biology (92-08)
Recommendations
Cites work
- scientific article; zbMATH DE number 2080275 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A More Effective Linear Kernelization for Cluster Editing
- Aggregating inconsistent information
- Applying Modular Decomposition to Parameterized Bicluster Editing
- Cluster graph modification problems
- Clustering with qualitative information
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Correlation clustering
- Correlation clustering with a fixed number of clusters
- Error compensation in leaf power problems
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Going weighted: parameterized algorithms for cluster editing
- Graph-Theoretic Concepts in Computer Science
- Graph-modeled data clustering: Exact algorithms for clique generation
- NP-hard problems in hierarchical-tree clustering
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
- Parametrized complexity theory.
- Polynomial-time data reduction for dominating set
- The Cluster Editing Problem: Implementations and Experiments
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
Cited in
(56)- A \(2k\) kernel for the cluster editing problem
- Fast FPT-Algorithms for Cleaning Grids
- Cluster editing with locally bounded modifications revisited
- Cluster editing: kernelization based on edge cuts
- A \(2k\) kernel for the cluster editing problem
- Efficient algorithms for cluster editing
- Kernelization: new upper and lower bound techniques
- Cluster editing: kernelization based on edge cuts
- On structural parameterizations of load coloring
- On subgraph complementation to \(H\)-free graphs
- Dominator coloring and CD coloring in almost cluster graphs
- On Making Directed Graphs Transitive
- Cluster editing with locally bounded modifications
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- On making directed graphs transitive
- Graph-based data clustering with overlaps
- Graph-Based Data Clustering with Overlaps
- On the complexity of multi-parameterized cluster editing
- Parameterized algorithms for min-max 2-cluster editing
- Exact algorithms for cluster editing: Evaluation and experiments
- Efficient Parameterized Preprocessing for Cluster Editing
- Editing graphs into disjoint unions of dense clusters
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- Destroying Bicolored $P_3$s by Deleting Few Edges
- Two edge modification problems without polynomial kernels
- A linear-time kernelization for the rooted k-leaf outbranching problem
- A simple and improved parameterized algorithm for bicluster editing
- Going weighted: parameterized algorithms for cluster editing
- Even faster parameterized cluster deletion and cluster editing
- The Multi-parameterized Cluster Editing Problem
- A More Effective Linear Kernelization for Cluster Editing
- Cluster editing
- A golden ratio parameterized algorithm for cluster editing
- Parameterized dynamic cluster editing
- On structural parameterizations of load coloring
- A quasi-quadratic vertex-kernel for cograph edge editing
- Alternative parameterizations for cluster editing
- A survey of parameterized algorithms and the complexity of edge modification
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Two edge modification problems without polynomial kernels
- \((1,1)\)-cluster editing is polynomial-time solvable
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Fixed-parameter enumerability of cluster editing and related problems
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- A new approximate cluster deletion algorithm for diamond-free graphs
- (Sub)linear kernels for edge modification problems towards structured graph classes
- Kernelization of packing problems
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
- Kernels for packing and covering problems
- Editing graphs into few cliques: complexity, approximation, and kernelization schemes
- On subgraph complementation to \(H\)-free Graphs
- Confluence in data reduction: bridging graph transformation and kernelization
- Iterative compression and exact algorithms
- Cluster editing problem for points on the real line: a polynomial time algorithm
This page was built for publication: A more effective linear kernelization for cluster editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006044)
