A probabilistic result for the max-cut problem on random graphs (Q5929142)
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: A probabilistic result for the max-cut problem on random graphs |
scientific article; zbMATH DE number 1588397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A probabilistic result for the max-cut problem on random graphs |
scientific article; zbMATH DE number 1588397 |
Statements
A probabilistic result for the max-cut problem on random graphs (English)
0 references
2001
0 references
probabilistic analysis
0 references
maximum cut
0 references
eigenvalues of random matrices
0 references
0 references
0.8357633352279663
0 references
0.8342975974082947
0 references
0.8066484332084656
0 references
0.8037718534469604
0 references
