An exact algorithm for MAX-CUT in sparse graphs (Q2467485)
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 exact algorithm for MAX-CUT in sparse graphs |
scientific article; zbMATH DE number 5228910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for MAX-CUT in sparse graphs |
scientific article; zbMATH DE number 5228910 |
Statements
An exact algorithm for MAX-CUT in sparse graphs (English)
0 references
21 January 2008
0 references
MAX-CUT
0 references
exact algorithm
0 references
sparse graphs
0 references
0 references
0.8871309757232666
0 references
0.8550767302513123
0 references
0.8374907374382019
0 references
0.8335302472114563
0 references
