How much does randomness help with locally checkable problems?

PODC '20: ACM Symposium on Principles of Distributed Computing Virtual Event Italy August, 2020, pp. 299-308, 2019.

Cited by: 0|Bibtex|Views42|DOI:https://doi.org/10.1145/3382734.3405715
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org|dl.acm.org

Abstract:

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are examples of LCLs. On the one hand, it is known that some LCLs benefit exponentially from r...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments