How local constraints influence network diameter and applications to LCL generalizations
<|reference_start|>How local constraints influence network diameter and applications to LCL generalizations: In this paper, we investigate how local rules enforced at every node can influence the topology of a network. More precisely, we establish several results on the diameter of trees as a function of the number of nodes, as listed below. These results have important consequences on the landscape of locally checkable labelings (LCL) on \emph{unbounded} degree graphs, a case in which our lack of knowledge is in striking contrast with that of \emph{bounded degree graphs}, that has been intensively studied recently. [See paper for full abstract.]<|reference_end|>
@article{bousquet2024how,
    title={How local constraints influence network diameter and applications to LCL
  generalizations},
    author={Nicolas Bousquet, Laurent Feuilloley and Th'eo Pierron},
    journal={arXiv preprint arXiv:2409.01305},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.01305},
    primaryClass={cs.DC}
}