An approximate algorithm for the solution of the problem of finding the maximum weighted cut of a graph (Q2897675)
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: An approximate algorithm for the solution of the problem of finding the maximum weighted cut of a graph |
scientific article; zbMATH DE number 6056735
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximate algorithm for the solution of the problem of finding the maximum weighted cut of a graph |
scientific article; zbMATH DE number 6056735 |
Statements
16 July 2012
0 references
global equilibrium search
0 references
maximum weighted cut of graph
0 references
An approximate algorithm for the solution of the problem of finding the maximum weighted cut of a graph (English)
0 references
0.8746242523193359
0 references
0.8450779914855957
0 references
0.7856928706169128
0 references
0.7799565196037292
0 references
0.7799140810966492
0 references