1 citations · 1 across the 3 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
Finding paths in sparse random graphs requires many queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\s…
math.CO2015
Finding Hamilton cycles in random graphs with few queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of ${\mat…