How much does randomness help with locally checkable problems?
Work
Year: 2020
Type: article
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, max... more
Institutions University of Freiburg, ETH Zurich, Aalto University
Cites: 24
Cited by: 20
Related to: 10
FWCI: 3.244
Citation percentile (by year/subfield): 80.83
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Sustainable cities and communities
Open Access status: green
Funder Academy of Finland
Grant ID 285721