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

最近共同祖先:通用树和改进的标记方案

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes

Fabian Kuhn, Konstantinos Panagiotou, Pascal Su

摘要:

我们研究了有根树中的最近共同祖先(NCA)函数。作为主要的概念贡献,本文介绍了通用树的NCA功能:对于一个给定的家庭的根树,一个NCA通用树$S$是一个根树,使家庭的任何树$T$可以嵌入到$S$,使嵌入的NCA在$T$的两个节点的$T$是等于NCA在$S$的嵌入的两个节点。作为主要的技术结果,我们给出了显式的构造尺寸为$n^{2.318}$的根$n$ -顶点树的家庭和尺寸为$n^{1.894}$的根二进制$n$ -顶点树的家庭的NCA-通用树。一个直接的后果是显式构造的NCA标记计划的标签大小为$2.318\log_2 n$和$1.894\log_2 n$的两个家庭的根树。这改进了Alstrup、Halvorsen和Larsen建立的最知名的此类标记方案[SODA 2014]。

英文摘要:

We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a given family of rooted trees, an NCA-universal tree $S$ is a rooted tree such that any tree $T$ of the family can be embedded into $S$ such that the embedding of the NCA in $T$ of two nodes of $T$ is equal to the NCA in $S$ of the embeddings of the two nodes. As the main technical result we give explicit constructions of NCA-universal trees of size $n^{2.318}$ for the family of rooted $n$-vertex trees and of size $n^{1.894}$ for the family of rooted binary $n$-vertex trees. A direct consequence is the explicit construction of NCA-labeling schemes with labels of size $2.318\log_2 n$ and $1.894\log_2 n$ for the two families of rooted trees. This improves on the best known such labeling schemes established by Alstrup, Halvorsen and Larsen [SODA 2014].

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

↑