Truly Work-efficient Parallel Deterministic $(\Delta +1)$-coloring and Maximal Independent Set

Abstract

We give deterministic parallel algorithms that compute a $(\Delta +1)$-coloring and a maximal independent set for a simple graph with $n$ vertices and $m$ edges in $O(n+m)$ work and $O(\mathrm{poly}\log n)$ depth.