The MAX-CUT of sparse random graphs (Q5743397)
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 MAX-CUT of sparse random graphs |
scientific article; zbMATH DE number 7053276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The MAX-CUT of sparse random graphs |
scientific article; zbMATH DE number 7053276 |
Statements
10 May 2019
0 references
0 references
0.8594185709953308
0 references
0.8285691738128662
0 references
0.8153172731399536
0 references
0.8102719187736511
0 references
0.8056958317756653
0 references
