Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6911198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustering with lower-bounded sizes. A general graph-theoretic framework |
scientific article; zbMATH DE number 6911198 |
Statements
Clustering with lower-bounded sizes. A general graph-theoretic framework (English)
0 references
26 July 2018
0 references
clustering
0 references
computational complexity
0 references
approximation algorithms
0 references
anonymisation
0 references
0.7782870531082153
0 references
0.7765048742294312
0 references
0.7553014755249023
0 references
