arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.12147cs.DS
收藏

排列图的最优距离标签

Optimal Distance Labeling for Permutation Graphs

Paweł Gawrychowski, Wojciech Janczewski

AI总结:

本文针对排列图距离标签问题,将上界从9log n+O(1)比特改进至3log n+O(log log n)比特,与已知下界3log n-O(log log n)匹配,从而闭合了该问题的上下界差距。

摘要:

排列图是两条平行线之间的一组线段的交集图。换句话说,它们由 n 个元素上的排列 π 定义,当且仅当 u<v 但 π(u)>π(v) 时,u 和 v 相邻。我们考虑在信息性标签方案的设置下计算此类图中的距离问题。这种方案的目标是给每个顶点 u 分配一个短的比特串 ℓ(u),使得 u 和 v 之间的距离仅使用 ℓ(u) 和 ℓ(v) 即可计算,而无需关于整个图的进一步知识(除了它是一个排列图之外)。这优雅地捕捉了我们希望数据结构是分布式的直觉,并且在试图获得与低阶项匹配的上下界时,通常会导致有趣的组合挑战。对于 n 个顶点的排列图的距离标签,Katz、Katz 和 Peleg [STACS 2000] 展示了如何构造由 O(log² n) 比特组成的标签。后来,Bazzaro 和 Gavoille [Discret. Math. 309(11)] 通过展示如何构造由 9log n + O(1) 比特组成的标签,并证明 3log n - O(log log n) 比特是必要的,获得了渐近最优的界限。然而,这留下了已知下界和上界之间的相当大的差距。我们通过展示如何构造由 3log n + O(log log n) 比特组成的标签来弥合这一差距。

英文摘要:

A permutation graph is the intersection graph of a set of segments between two parallel lines. In other words, they are defined by a permutation $π$ on $n$ elements, such that $u$ and $v$ are adjacent if an only if $u<v$ but $π(u)>π(v)$. We consider the problem of computing the distances in such a graph in the setting of informative labeling schemes. The goal of such a scheme is to assign a short bitstring $\ell(u)$ to every vertex $u$, such that the distance between $u$ and $v$ can be computed using only $\ell(u)$ and $\ell(v)$, and no further knowledge about the whole graph (other than that it is a permutation graph). This elegantly captures the intuition that we would like our data structure to be distributed, and often leads to interesting combinatorial challenges while trying to obtain lower and upper bounds that match up to the lower-order terms. For distance labeling of permutation graphs on $n$ vertices, Katz, Katz, and Peleg [STACS 2000] showed how to construct labels consisting of $\mathcal{O}(\log^{2} n)$ bits. Later, Bazzaro and Gavoille [Discret. Math. 309(11)] obtained an asymptotically optimal bounds by showing how to construct labels consisting of $9\log{n}+\mathcal{O}(1)$ bits, and proving that $3\log{n}-\mathcal{O}(\log{\log{n}})$ bits are necessary. This however leaves a quite large gap between the known lower and upper bounds. We close this gap by showing how to construct labels consisting of $3\log{n}+\mathcal{O}(\log\log n)$ bits.

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

↑