Almost global problems in the LOCAL model

Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
4 Downloads (Pure)

Abstract

The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the LOCAL model and locally checkable problems (LCLs) in bounded-degree graphs, the following picture emerges:There are lots of problems with time complexities of Θ(log n) or Θ(log n).It is not possible to have a problem with complexity between ω(log n) and o(log n).In general graphs, we can construct LCL problems with infinitely many complexities between ω(log n) and no(1).In trees, problems with such complexities do not exist. However, the high end of the complexity spectrum was left open by prior work. In general graphs there are LCL problems with complexities of the form Θ(nα) for any rational 0 < α≤ 1 / 2 , while for trees only complexities of the form Θ(n1/k) are known. No LCL problem with complexity between ω(n) and o(n) is known, and neither are there results that would show that such problems do not exist. We show that:In general graphs, we can construct LCL problems with infinitely many complexities between ω(n) and o(n).In trees, problems with such complexities do not exist. Put otherwise, we show that any LCL with a complexity o(n) can be solved in time O(n) in trees, while the same is not true in general graphs.

Original languageEnglish
Pages (from-to)259-281
Number of pages23
JournalDISTRIBUTED COMPUTING
Volume34
Issue number4
DOIs
Publication statusPublished - Aug 2021
MoE publication typeA1 Journal article-refereed

Keywords

  • Distributed complexity theory
  • LOCAL model
  • Locally checkable labellings

Fingerprint

Dive into the research topics of 'Almost global problems in the LOCAL model'. Together they form a unique fingerprint.

Cite this