Even faster parameterized cluster deletion and cluster editing
From MaRDI portal
Recommendations
Cites work
- A \(2k\) kernel for the cluster editing problem
- A more effective linear kernelization for cluster editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Beyond the flow decomposition barrier
- Bounded-degree techniques accelerate some parameterized graph algorithms
- Cluster editing problem for points on the real line: a polynomial time algorithm
- Cluster graph modification problems
- Fixed-parameter algorithms for cluster vertex deletion
- Fixed-parameter enumerability of cluster editing and related problems
- Going weighted: parameterized algorithms for cluster editing
- Graph-modeled data clustering: Exact algorithms for clique generation
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- The Cluster Editing Problem: Implementations and Experiments
Cited in
(32)- A golden ratio parameterized algorithm for cluster editing
- Branch-and-price for \(p\)-cluster editing
- Faster parameterized algorithm for cluster vertex deletion
- The maximum independent union of cliques problem: complexity and exact approaches
- Subexponential algorithm for d-cluster edge deletion: exception or rule?
- Cluster deletion revisited
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Bounded-degree techniques accelerate some parameterized graph algorithms
- The cluster deletion problem for cographs
- On making directed graphs transitive
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- Destroying Bicolored $P_3$s by Deleting Few Edges
- Branch-and-cut approaches for p-cluster editing
- Parameterized Dynamic Cluster Editing
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- Cluster editing
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules
- A survey of parameterized algorithms and the complexity of edge modification
- Parameterized algorithms for editing to uniform cluster graph
- When can cluster deletion with bounded weights be solved efficiently?
- Smaller kernels for 3-leaf power modifications problems
- Parameterized complexity of weighted target set selection
- Exact and heuristic solution approaches for the cluster deletion problem on general graphs
- Cluster editing parameterized above modification-disjoint P₃-packings
- The complexity of cluster vertex splitting and company
- Cluster editing with locally bounded modifications
- Cluster editing parameterized above modification-disjoint P₃-Packings
- When can cluster deletion with bounded weights be solved efficiently?
- Cluster editing on cographs and related classes
- Parameterized algorithms for editing to uniform cluster graph
This page was built for publication: Even faster parameterized cluster deletion and cluster editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944120)
