7 citations · 7 across the 2 of their papers we have counts for
1 paper · 1 filter
Matthieu Jonckheere, Manuel Sáenz
In this work we study the time complexity for the search of local minima in random graphs whose vertices have i.i.d. cost values. We show that, for Erdös-Rényi graphs with connecti…