3 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Simina Brânzei, Ioannis Panageas, Dimitris Paparas
We analyze the query complexity of finding a local minimum in t rounds on general graphs. More precisely, given a graph G=(V,E) and oracle access to an unknown function $f :…