Tight bounds for parameterized complexity of Cluster Editing
From MaRDI portal
Recommendations
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- On the complexity of multi-parameterized cluster editing
- Fixed-Parameter Tractable Generalizations of Cluster Editing
- The Multi-parameterized Cluster Editing Problem
- Graph-Theoretic Concepts in Computer Science
- Exact algorithms for cluster editing: Evaluation and experiments
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- The Cluster Editing Problem: Implementations and Experiments
- Cluster editing with locally bounded modifications revisited
- Parameterized algorithms for min-max 2-cluster editing
Cited in
(10)- The Multi-parameterized Cluster Editing Problem
- Cluster editing
- Graph-Theoretic Concepts in Computer Science
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- A PTAS for the Cluster Editing Problem on Planar Graphs
- Sufficient conditions for edit-optimal clusters
- Faster parameterized algorithms for deletion to split graphs
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
- Parameterized algorithms for module map problems
This page was built for publication: Tight bounds for parameterized complexity of Cluster Editing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957869)
