Locally Checkable Labelings with Small Messages

by   Alkida Balliu, et al.

A rich line of work has been addressing the computational complexity of locally checkable labelings (LCLs), illustrating the landscape of possible complexities. In this paper, we study the landscape of LCL complexities under bandwidth restrictions. Our main results are twofold. First, we show that on trees, the CONGEST complexity of an LCL problem is asymptotically equal to its complexity in the LOCAL model. An analog statement for general (non-LCL) problems is known to be false. Second, we show that for general graphs this equivalence does not hold, by providing an LCL problem for which we show that it can be solved in O(log n) rounds in the LOCAL model, but requires Ω̃(n^1/2) rounds in the CONGEST model.


Almost Global Problems in the LOCAL Model

The landscape of the distributed time complexity is nowadays well-unders...

The Landscape of Distributed Complexities on Trees and Beyond

We study the local complexity landscape of locally checkable labeling (L...

The distributed complexity of locally checkable problems on paths is decidable

Consider a computer network that consists of a path with n nodes. The no...

Local Mending

In this work we introduce the graph-theoretic notion of mendability: for...

How much does randomness help with locally checkable problems?

Locally checkable labeling problems (LCLs) are distributed graph problem...

Deterministic Logarithmic Completeness in the Distributed Sleeping Model

We provide a deterministic scheme for solving any decidable problem in t...

Sinkless orientation is hard also in the supported LOCAL model

We show that any algorithm that solves the sinkless orientation problem ...