Cite
HARVARD Citation
Ferber, A. et al. (2017). Finding paths in sparse random graphs requires many queries1. Random structures & algorithms. 50 (1), pp. 71-85. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Ferber, A. et al. (2017). Finding paths in sparse random graphs requires many queries1. Random structures & algorithms. 50 (1), pp. 71-85. [Online].