Cite
HARVARD Citation
Ben‐Eliezer, O. et al. (2020). Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process. Random structures & algorithms. 57 (4), pp. 892-919. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Ben‐Eliezer, O. et al. (2020). Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process. Random structures & algorithms. 57 (4), pp. 892-919. [Online].