License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2020.41
URN: urn:nbn:de:0030-drops-131197
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13119/
Go to the corresponding LIPIcs Volume Portal

Chang, Yi-Jun ; Studený, Jan ; Suomela, Jukka

Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens

pdf-format:
LIPIcs-DISC-2020-41.pdf (0.3 MB)

Abstract

We study the following algorithm synthesis question: given the description of a locally checkable graph problem Π for paths or cycles, determine in which instances Π is solvable, determine what is the locality of Π, and construct an asymptotically optimal distributed algorithm for solving Π (in the usual LOCAL model of distributed computing). To answer such questions, we represent Π as a nondeterministic finite automaton ℳ over a unary alphabet, and identify polynomial-time-computable properties of automaton ℳ that capture the locality and solvability of problem Π.

BibTeX - Entry

@InProceedings{chang_et_al:LIPIcs:2020:13119,
  author =	{Yi-Jun Chang and Jan Studen{\'y} and Jukka Suomela},
  title =	{{Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens}},
  booktitle =	{34th International Symposium on Distributed Computing (DISC 2020)},
  pages =	{41:1--41:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-168-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{179},
  editor =	{Hagit Attiya},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13119},
  URN =		{urn:nbn:de:0030-drops-131197},
  doi =		{10.4230/LIPIcs.DISC.2020.41},
  annote =	{Keywords: Algorithm synthesis, locally checkable labeling problems, LOCAL model, locality, distributed computational complexity, nondeterministic finite automata}
}

Keywords: Algorithm synthesis, locally checkable labeling problems, LOCAL model, locality, distributed computational complexity, nondeterministic finite automata
Collection: 34th International Symposium on Distributed Computing (DISC 2020)
Issue Date: 2020
Date of publication: 07.10.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI