2 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Artur Czumaj, Peter Davies, Merav Parter
We present a deterministic O(logloglogn)-round low-space Massively Parallel Computation (MPC) algorithm for the classical problem of (Δ+1)-coloring on n-vertex graphs.…