1. Finding paths in sparse random graphs requires many queries1. Issue 1 (29th September 2016) Authors: Ferber, Asaf; Krivelevich, Michael; Sudakov, Benny; Vieira, Pedro Journal: Random structures & algorithms Issue: Volume 50:Issue 1(2017) Page Start: 71 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗