Integer programming models for detecting graph bipartitions with structural requirements (Q4584872)
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: Integer programming models for detecting graph bipartitions with structural requirements |
scientific article; zbMATH DE number 6931683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Integer programming models for detecting graph bipartitions with structural requirements |
scientific article; zbMATH DE number 6931683 |
Statements
Integer programming models for detecting graph bipartitions with structural requirements (English)
0 references
4 September 2018
0 references
normalized cut
0 references
clique relaxations
0 references
graph partitioning
0 references
data classification
0 references
0.7441450357437134
0 references
0.72362220287323
0 references
0.7177427411079407
0 references
0.7155271768569946
0 references
0.7130081057548523
0 references
