Sublinear Algorithms for (Δ+ 1) Vertex Coloring
SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp. 767-786, 2019.
Any graph with maximum degree Δ admits a proper vertex coloring with Δ + 1 colors that can be found via a simple sequential greedy algorithm in linear time and space. But can one find such a coloring via a sublinear algorithm? We answer this fundamental question in the affirmative for several canonical classes of sublinear algorithms inc...More
Full Text (Upload PDF)
PPT (Upload PPT)