Sublinear Algorithms for (Δ+ 1) Vertex Coloring

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp. 767-786, 2019.

Cited by: 35|Bibtex|Views24|DOI:https://doi.org/10.5555/3310435.3310483
EI
Other Links: dblp.uni-trier.de|dl.acm.org

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments