An effective compact formulation of the max cut problem on sparse graphs (Q2840693)
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 effective compact formulation of the max cut problem on sparse graphs |
scientific article; zbMATH DE number 6190228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective compact formulation of the max cut problem on sparse graphs |
scientific article; zbMATH DE number 6190228 |
Statements
An effective compact formulation of the max cut problem on sparse graphs (English)
0 references
23 July 2013
0 references
max cut problem
0 references
odd circuits. sparse graphs
0 references
intersecting cuts and circuits
0 references
0.7991572022438049
0 references
0.7856429219245911
0 references
0.7836033701896667
0 references
0.7833295464515686
0 references
