Efficient Classification of Locally Checkable Problems in Regular Trees
Loading...
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Date
2022
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
1-19
Series
36th International Symposium on Distributed Computing (DISC 2022), Leibniz International Proceedings in Informatics (LIPIcs), Volume 246
Abstract
We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the [Θ(log n), Θ(n)] region, in two settings. We present one algorithm for unrooted regular trees and another algorithm for rooted regular trees. The algorithms take the description of a locally checkable labeling problem as input, and the running time is polynomial in the size of the problem description. The algorithms decide if the problem is solvable in O(log n) rounds. If not, it is known that the complexity has to be Θ(n^{1/k}) for some k = 1, 2, ..., and in this case the algorithms also output the right value of the exponent k. In rooted trees in the O(log n) case we can then further determine the exact complexity class by using algorithms from prior work; for unrooted trees the more fine-grained classification in the O(log n) region remains an open question.Description
Keywords
Other note
Citation
Balliu, A, Brandt, S, Chang, Y-J, Olivetti, D, Studený, J & Suomela, J 2022, Efficient Classification of Locally Checkable Problems in Regular Trees . in C Scheideler (ed.), 36th International Symposium on Distributed Computing (DISC 2022) ., 8, Leibniz International Proceedings in Informatics (LIPIcs), vol. 246, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-19, International Symposium on Distributed Computing, Augusta, Georgia, United States, 25/10/2022 . https://doi.org/10.4230/LIPIcs.DISC.2022.8
