Min-max communities in graphs: complexity and computational properties (Q899313)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Min-max communities in graphs: complexity and computational properties |
scientific article; zbMATH DE number 6524283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min-max communities in graphs: complexity and computational properties |
scientific article; zbMATH DE number 6524283 |
Statements
Min-max communities in graphs: complexity and computational properties (English)
0 references
28 December 2015
0 references
community discovery
0 references
graph partitioning
0 references
0.8242507576942444
0 references
0.8013612627983093
0 references
0.7813146710395813
0 references
0.7708861827850342
0 references
0.7609628438949585
0 references
