Papers › Locally Checkable Problems in Rooted Trees
Locally Checkable Problems in Rooted Trees
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Consider any locally checkable labeling problem Π in rooted regular trees: there is a finite set of labels Σ, and for each label x ∈Σ we specify what are permitted label combinations of the children for an internal node of label x (the leaf nodes are unconstrained). This formalism is expressive enough to capture many classic problems studied in distributed computing, including vertex coloring, edge coloring, and maximal independent set. We show that the distributed computational complexity of any such problem Π falls in one of the following classes: it is O(1), Θ(log^* n), Θ(logn), or n^(Θ(1)) rounds in trees with n nodes (and all of these classes are nonempty). We show that the complexity of any given problem is the same in all four standard models of distributed graph algorithms: deterministic 𝖫𝖮𝖢𝖠𝖫, randomized 𝖫𝖮𝖢𝖠𝖫, deterministic 𝖢𝖮𝖭𝖦𝖤𝖲𝖳, and randomized 𝖢𝖮𝖭𝖦𝖤𝖲𝖳 model. In particular, we show that randomness does not help in this setting, and the complexity class Θ(loglogn) does not exist (while it does exist in the broader setting of general trees). We also show how to systematically determine the complexity class of any such problem Π, i.e., whether Π takes O(1), Θ(log^* n), Θ(logn), or n^(Θ(1)) rounds. While the algorithm may take exponential time in the size of the description of Π, it is nevertheless practical: we provide a freely available implementation of the classifier algorithm, and it is fast enough to classify many problems of interest.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections