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

次线性距离标记

Sublinear Distance Labeling

Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat

摘要:

距离标记方案用二进制字符串标记图的$n$节点,使得给定任何两个节点的标签,可以通过仅查看标签来确定图中两个节点之间的距离。保留$D$的距离标记方案仅返回彼此距离至少为$D$的节点对之间的精确距离。在本文中,我们考虑距离标记计划的经典情况下,无权图的有向和无向边。我们提出了一个$O(\frac{n}{D}\log^2 D)$位$D$-保持距离标记计划,提高了以前的Bollobás等。[SIAM J. Discrete Math.2005]。我们还给出了$Ω(\frac{n}{D})$的一个几乎匹配下界.与我们的$D$-保持距离标记方案作为一个积木,我们还实现了以下结果:1。我们提出了第一个距离标记计划的大小$o(n)$稀疏图(因此有界度图)。这解决了一个开放的问题,由Gavoille等。[J. Algo. 2004],从而在需要$Ω(n)$位的一般图中将复杂度与距离标记分离,Moon [Proc. of Glasgow Math.Association 1965]。2.对于近似的$r$-添加剂标签计划,返回的距离在$r$的添加剂误差,我们显示了一个计划的大小$O\left ( \frac{n}{r} \cdot\frac{\operatorname{polylog} (r\log n)}{\log n} \right )$为$r \ge 2$。这改进了Alstrup et.等人[SODA 2016]针对子多项式$r$,并且是Gawrychowski等人[arXiv预印本2015]的结果的推广,其针对$r=2$显示了这一点。

英文摘要:

A distance labeling scheme labels the $n$ nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels. A $D$-preserving distance labeling scheme only returns precise distances between pairs of nodes that are at distance at least $D$ from each other. In this paper we consider distance labeling schemes for the classical case of unweighted graphs with both directed and undirected edges. We present a $O(\frac{n}{D}\log^2 D)$ bit $D$-preserving distance labeling scheme, improving the previous bound by Bollobás et. al. [SIAM J. Discrete Math. 2005]. We also give an almost matching lower bound of $Ω(\frac{n}{D})$. With our $D$-preserving distance labeling scheme as a building block, we additionally achieve the following results: 1. We present the first distance labeling scheme of size $o(n)$ for sparse graphs (and hence bounded degree graphs). This addresses an open problem by Gavoille et. al. [J. Algo. 2004], hereby separating the complexity from distance labeling in general graphs which require $Ω(n)$ bits, Moon [Proc. of Glasgow Math. Association 1965]. 2. For approximate $r$-additive labeling schemes, that return distances within an additive error of $r$ we show a scheme of size $O\left ( \frac{n}{r} \cdot\frac{\operatorname{polylog} (r\log n)}{\log n} \right )$ for $r \ge 2$. This improves on the current best bound of $O\left(\frac{n}{r}\right)$ by Alstrup et. al. [SODA 2016] for sub-polynomial $r$, and is a generalization of a result by Gawrychowski et al. [arXiv preprint 2015] who showed this for $r=2$.

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

↑