Cite
HARVARD Citation
Krivelevich, M. et al. (2013). Longest cycles in sparse random digraphs12. Random structures & algorithms. 43 (1), pp. 1-15. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Krivelevich, M. et al. (2013). Longest cycles in sparse random digraphs12. Random structures & algorithms. 43 (1), pp. 1-15. [Online].