Efficient Deterministic Algorithms for Vertex Coloring in Sparse Graphs using Adaptive Massively Parallel Computation

This work presents deterministic algorithms for efficiently computing vertex colorings in sparse graphs parameterized by their arboricity, a measure of sparsity, in the Adaptive Massively Parallel Computation (AMPC) model.