Finding paths in sparse random graphs requires many queries.

Asaf Ferber Michael Krivelevich Benny Sudakov Pedro Vieira

Published in: Random Struct. Algorithms (2017)

Keyphrases

random graphs
graph theoretic
query language
query processing
learning curves
data sources
phase transition
constraint satisfaction
small world