Log In Sign Up

The Landscape of Distributed Complexities on Trees and Beyond

by   Christoph Grunau, et al.

We study the local complexity landscape of locally checkable labeling (LCL) problems on constant-degree graphs with a focus on complexities below log^* n. Our contribution is threefold: Our main contribution is that we complete the classification of the complexity landscape of LCL problems on trees in the LOCAL model, by proving that every LCL problem with local complexity o(log^* n) has actually complexity O(1). This result improves upon the previous speedup result from o(loglog^* n) to O(1) by [Chang, Pettie, FOCS 2017]. In the related LCA and Volume models [Alon, Rubinfeld, Vardi, Xie, SODA 2012, Rubinfeld, Tamir, Vardi, Xie, 2011, Rosenbaum, Suomela, PODC 2020], we prove the same speedup from o(log^* n) to O(1) for all bounded degree graphs. Similarly, we complete the classification of the LOCAL complexity landscape of oriented d-dimensional grids by proving that any LCL problem with local complexity o(log^* n) has actually complexity O(1). This improves upon the previous speed-up from o(√(log^* n)) by Suomela in [Chang, Pettie, FOCS 2017].


page 1

page 2

page 3

page 4


The Complexity Landscape of Distributed Locally Checkable Problems on Trees

Recent research revealed the existence of gaps in the complexity landsca...

Almost Global Problems in the LOCAL Model

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

Locally Checkable Labelings with Small Messages

A rich line of work has been addressing the computational complexity of ...

The randomized local computation complexity of the Lovász local lemma

The Local Computation Algorithm (LCA) model is a popular model in the fi...

Mending Partial Solutions with Few Changes

In this paper, we study the notion of mending, i.e. given a partial solu...

Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees

In this work, we develop the low-space Massively Parallel Computation (M...

Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems

Consider a graph problem that is locally checkable but not locally solva...