Cite
HARVARD Citation
Gamarnik, D. et al. (2018). On the max‐cut of sparse random graphs. Random structures & algorithms. 52 (2), pp. 219-262. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Gamarnik, D. et al. (2018). On the max‐cut of sparse random graphs. Random structures & algorithms. 52 (2), pp. 219-262. [Online].