22 citations · 38 across the 9 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2019★ 1 cited
Local approximation of the Maximum Cut in regular graphs
É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…
math.CO2018
Distributed coloring of graphs with an optimal number of colors
Étienne Bamas, Louis Esperet
This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e.\ with the minimum number of colors) in the LOCAL model of comput…