We present a randomized distributed algorithm that computes a Δ -coloring in any non-complete graph with maximum degree Δ ≥ 4 in O ( log Δ ) + 2 O ( log log n ) rounds, as well as a randomized algorithm that computes a Δ -colorin... ...

请注册登录后继续浏览