22 citations · 38 across the 9 of their papers we have counts for
1 paper · 1 filter
Étienne Bamas, Louis Esperet
This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side…