局部约束如何影响网络直径及其对LCL推广的应用
How local constraints influence network diameter and applications to LCL generalizations
AI总结:
本文研究节点局部规则对网络拓扑的影响,建立树的直径与节点数关系的若干结果,并揭示其对无界度图上LCL问题研究的重要意义。
摘要:
在本文中,我们研究在每个节点上强制执行的局部规则如何影响网络的拓扑结构。更准确地说,我们建立了关于树的直径作为节点数函数的若干结果,如下所列。这些结果对无界度图上局部可检查标记(LCL)的整体格局具有重要影响,而在无界度图这一情形中,我们知识的缺乏与最近被深入研究的有限度图情形形成鲜明对比。[完整摘要见论文。]
英文摘要:
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.]
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。