Cite
APA Citation
Anastos, M., & Frieze, A. (2022). a scaling limit for the length of the longest cycle in a sparse random digraph. Random structures & algorithms, 60(1), 3–24. http://access.bl.uk/ark:/81055/vdc_100145641717.0x00002d
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Anastos, M., & Frieze, A. (2022). a scaling limit for the length of the longest cycle in a sparse random digraph. Random structures & algorithms, 60(1), 3–24. http://access.bl.uk/ark:/81055/vdc_100145641717.0x00002d