arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.12894cs.DCcs.DM
收藏

基于距离的领导者选举认证在网格图及其子类的局部识别中

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses

CNRS, Aix-Marseille Université(法国国家科学研究中心,艾克斯-马赛大学);Paderborn University(帕德博恩大学)

Jérémie Chalopin, Victor Chepoi, Maria Kokkou

AI总结:

本文提出了一种基于距离的领导者选举认证方法,用于匿名网格图及其子类的局部识别。

摘要:

本文提出了一种2局部证明标记方案,其标签集为{0,1,2},用于在匿名网格图中进行领导者选举。网格图是一种由距离条件定义的一般图类。它们包含多个重要的图类,长期以来在度量图论、几何群论和离散数学中受到了广泛关注:中位图、桥接图、弦图、Helly图、双极图、模图、弱模图以及模体的基图。我们还提供了3局部证明标记方案,用于通过大小为O(log D)(其中D是图的直径)的标签来识别这些网格图的子类。为建立这些结果,我们证明在网格图中,可以局部验证每个顶点v是否由其到任意根s的距离d(s,v)标记。为设计识别上述网格图子类的证明标记方案,我们利用此距离验证来确保图的三角形-正方形复形是单连通的,然后依赖于我们考虑的不同类别的现有局部到全局特征化。为了获得具有常数大小标签的领导者选举证明标记方案,我们进一步证明可以局部检查每个v是否由d(s,v) mod 3对某个指定为领导者的根s进行标记。

英文摘要:

In this paper, we present a 2-local proof labeling scheme with labels in $\{ 0,1,2\}$ for leader election in anonymous meshed graphs. Meshed graphs form a general class of graphs defined by a distance condition. They comprise several important classes of graphs, which have long been the subject of intensive studies in metric graph theory, geometric group theory, and discrete mathematics: median graphs, bridged graphs, chordal graphs, Helly graphs, dual polar graphs, modular, weakly modular graphs, and basis graphs of matroids. We also provide 3-local proof labeling schemes to recognize these subclasses of meshed graphs using labels of size $O(\log D)$ (where $D$ is the diameter of the graph). To establish these results, we show that in meshed graphs, we can verify locally that every vertex $v$ is labeled by its distance $d(s,v)$ to an arbitrary root $s$. To design proof labeling schemes to recognize the subclasses of meshed graphs mentioned above, we use this distance verification to ensure that the triangle-square complex of the graph is simply connected and we then rely on existing local-to-global characterizations for the different classes we consider. To get a proof-labeling scheme for leader election with labels of constant size, we then show that we can check locally if every $v$ is labeled by $d(s,v) \pmod{3}$ for some root $s$ that we designate as the leader.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑