Locally Checkable Labelings with Small Messages

05/12/2021
by   Alkida Balliu, et al.
0

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.

READ FULL TEXT
research
05/12/2018

Almost Global Problems in the LOCAL Model

The landscape of the distributed time complexity is nowadays well-unders...
research
02/09/2022

The Landscape of Distributed Complexities on Trees and Beyond

We study the local complexity landscape of locally checkable labeling (L...
research
08/08/2023

On the Node-Averaged Complexity of Locally Checkable Problems on Trees

Over the past decade, a long line of research has investigated the distr...
research
11/05/2018

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...
research
02/17/2021

Local Mending

In this work we introduce the graph-theoretic notion of mendability: for...
research
09/21/2020

The Complexity Landscape of Distributed Locally Checkable Problems on Trees

Recent research revealed the existence of gaps in the complexity landsca...
research
01/27/2023

Energy-Efficient Distributed Algorithms for Synchronous Networks

We study the design of energy-efficient algorithms for the LOCAL and CON...

Please sign up or login with your details

Forgot password? Click here to reset