Graph clustering with a constraint on cluster sizes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7746258
- Correlation clustering with constrained cluster sizes and extended weights bounds
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
- Approximation algorithms for min-sum \(p\)-clustering
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Cites work
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- Aggregating inconsistent information: ranking and clustering
- Approximating Symmetric Relations by Equivalence Relations
- Approximation algorithms for graph approximation problems
- 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 with a fixed number of clusters
- Graph clustering
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3797792 (Why is no real title available?)
- La reduction minimale d'un graphe à une reunion de cliques
- NP-hard problems in hierarchical-tree clustering
Cited in
(19)- Clustering with local restrictions
- Limitations on regularity lemmas for clustering graphs
- Clustering on k-Edge-Colored Graphs
- An approximation algorithm for clustering graphs with dominating diametral path
- Bounded size graph clustering with applications to stream processing
- Approximation algorithms for graph approximation problems
- Clustering on \(k\)-edge-colored graphs
- scientific article; zbMATH DE number 2043371 (Why is no real title available?)
- Graph Clustering using Effective Resistance
- Metric-Constrained Optimization for Graph Clustering Algorithms
- Approximate algorithms for graph clustering problem
- Size-constrained graph partitioning polytopes
- scientific article; zbMATH DE number 7746258 (Why is no real title available?)
- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes
- On cluster editing problem with clusters of small sizes
- Approximation algorithms for graph clustering problems with clusters of bounded size
- Clustering complexity and an approximation algorithm for a version of the cluster editing problem
- Clustering with lower-bounded sizes. A general graph-theoretic framework
- Approximation algorithms for the cluster editing problem with small clusters
This page was built for publication: Graph clustering with a constraint on cluster sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959182)
