Cite
MLA Citation
David Gamarnik and Quan Li. “On the max‐cut of sparse random graphs.” Random structures & algorithms, vol. 52, no. 2, 2018, pp. 219–262. http://access.bl.uk/ark:/81055/vdc_100057432026.0x00003b
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
David Gamarnik and Quan Li. “On the max‐cut of sparse random graphs.” Random structures & algorithms, vol. 52, no. 2, 2018, pp. 219–262. http://access.bl.uk/ark:/81055/vdc_100057432026.0x00003b