An effective compact formulation of the max cut problem on sparse graphs (Q2840693): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2011.05.020 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2011.05.020 / rank | |||
Normal rank | |||
Latest revision as of 00:45, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective compact formulation of the max cut problem on sparse graphs |
scientific article |
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
