Graph Partitioning in Connected Components with Minimum Size Constraints via Mixed Integer Programming (Q6505499)
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: Graph Partitioning in Connected Components with Minimum Size Constraints via Mixed Integer Programming |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Partitioning in Connected Components with Minimum Size Constraints via Mixed Integer Programming |
scientific article from arXiv |
Statements
Graph Partitioning in Connected Components with Minimum Size Constraints via Mixed Integer Programming (English)
0 references
