Locally checkable problems in rooted trees

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

Full description

Bibliographic Details

Published in:	Distributed computing Vol. 36; no. 3; pp. 277 - 311
Main Authors:	Balliu, Alkida, Brandt, Sebastian, Chang, Yi-Jun, Olivetti, Dennis, Studený, Jan, Suomela, Jukka, Tereshchenko, Aleksandr
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2023 Springer Nature B.V
Subjects:	Algorithms Automation Children & youth Complexity Computer Communication Networks Computer Hardware Computer networks Computer Science Computer Systems Organization and Communication Networks Distributed processing Graph coloring Labels Nodes Software Engineering/Programming and Operating Systems Theory of Computation
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!