Approximation algorithms for the cluster editing problem with small clusters
From MaRDI portal
Cites work
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Aggregating inconsistent information: ranking and clustering
- Approximating Symmetric Relations by Equivalence Relations
- Approximation algorithms and hardness results for the clique packing problem
- Cluster editing with locally bounded modifications
- Cluster graph modification problems
- Clustering with qualitative information
- Computational complexity of the graph approximation problem
- Computational complexity of the problem of approximation by graphs with connected components of bounded size
- Correlation clustering
- Correlation clustering in general weighted graphs
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Graph clustering with a constraint on cluster sizes
- La reduction minimale d'un graphe à une reunion de cliques
- NP-hard problems in hierarchical-tree clustering
- On cluster editing problem with clusters of small sizes
- Packings by cliques and by finite families of graphs
- Short survey on graph correlation clustering with minimization criteria
This page was built for publication: Approximation algorithms for the cluster editing problem with small clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305053)
