Locally Checkable Labelings with Small Messages

Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, Jukka Suomela

Publikation: KonferenzbeitragPaperBegutachtung

Abstract

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 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.

Originalspracheenglisch
Seiten8:1-8:18
DOIs
PublikationsstatusVeröffentlicht - 1 Okt. 2021
Extern publiziertJa
Veranstaltung35th International Symposium on Distributed Computing: DISC 2021 - Virtual, Freiburg, Deutschland
Dauer: 4 Okt. 20218 Okt. 2021

Konferenz

Konferenz35th International Symposium on Distributed Computing
Land/GebietDeutschland
OrtVirtual, Freiburg
Zeitraum4/10/218/10/21

ASJC Scopus subject areas

  • Software

Fingerprint

Untersuchen Sie die Forschungsthemen von „Locally Checkable Labelings with Small Messages“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren