On Local Distributed Sampling and Counting
Weiming Feng, Yitong Yin · 2018
In classic distributed graph problems, each instance on a graph specifies a space of feasible solutions (e.g. all proper (Δ + 1)-listcolorings of the graph), and the task of distributed algorithm is to construct a feasible solution using local information.