arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.18188cs.DC
收藏

局部可检查标记问题的定义方式并不重要

It does not matter how you define locally checkable labelings

Aalto University(阿尔托大学)

Antonio Cruciani, Avinandan Das, Alesya Raevskaya, Jukka Suomela

AI总结:

本文表明局部可检查标记问题的定义方式不影响其复杂性分析,通过展示两种形式之间的转换方法,证明了其在分布式计算中的鲁棒性。

摘要:

局部可检查标记问题(LCLs)构成了现代分布式图算法理论的基础。首先在Naor和Stockmeyer于1993年发表的开创性论文中被引入,这些是可以通过列出有限个有效局部邻域来描述的图问题。这种看似简单的定义在两个目标之间达到了谨慎的平衡:它们是一组问题的集合,足以涵盖众多对本领域研究者感兴趣的问题,同时又足够严格,使得可以证明对所有LCL问题都成立的强有力定理。特别是,LCL问题的分布式复杂性景观现在已经非常清楚。在本文中,我们展示了LCL问题的家族对变化非常具有鲁棒性。我们提出了一种非常受限的局部可检查问题家族(本质上是“节点-边可检查”形式,源自于轮次消除,限制在正则无标签图上);最重要的是,此类问题不能直接引用例如短周期的存在。我们展示了可以在这两种形式之间进行转换(存在双向的局部减少,仅需访问对称打破 oracle,因此开销最多是 LOCAL 模型中的加法 O(log* n) 轮次)。

英文摘要:

Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by listing a finite set of valid local neighborhoods. This seemingly simple definition strikes a careful balance between two objectives: they are a family of problems that is broad enough so that it captures numerous problems that are of interest to researchers working in this field, yet restrictive enough so that it is possible to prove strong theorems that hold for all LCL problems. In particular, the distributed complexity landscape of LCL problems is now very well understood. In this work we show that the family of LCL problems is extremely robust to variations. We present a very restricted family of locally checkable problems (essentially, the "node-edge checkable" formalism familiar from round elimination, restricted to regular unlabeled graphs); most importantly, such problems cannot directly refer to e.g. the existence of short cycles. We show that one can translate between the two formalisms (there are local reductions in both directions that only need access to a symmetry-breaking oracle, and hence the overhead is at most an additive $O(\log^* n)$ rounds in the LOCAL model).

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

↑