The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742)
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: The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts |
scientific article; zbMATH DE number 221850
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts |
scientific article; zbMATH DE number 221850 |
Statements
The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (English)
0 references
29 June 1993
0 references
graph partitioning
0 references
combinatorial cuts
0 references
