Cite
APA Citation
Ferber, A., Krivelevich, M., Sudakov, B., & Vieira, P. (2017). finding paths in sparse random graphs requires many queries1. Random structures & algorithms, 50(1), 71–85. http://access.bl.uk/ark:/81055/vdc_100039249484.0x000033