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

一种带链接的最近公共祖先数据结构

A Data Structure for Nearest Common Ancestors with Linking

Harold N. Gabow

摘要:

考虑一个通过$link$操作演化的林,这些操作使一棵树的根节点成为另一棵树中节点的子节点。与$link$操作混合的是$nca$操作,当存在两个给定节点的最近共同祖先时,该操作返回该节点的最近共同祖先。本文表明,一系列的$m$,如$nca$和$link$操作的$n$节点的森林可以处理在线的时间$O(mα(m,n)+n)$。这在以前仅对于受限类型的$link$操作是已知的。特殊情况下,一个$link$只通过添加一个新的叶扩展树发生在埃德蒙兹的算法,找到一个最大的重量匹配的一般图。将我们的算法应用到Edmonds算法的\cite{G17}实现中,实现了加权匹配的时间$O(n(m + n\log n))$,这是一个可以证明的最佳渐近界($n$和$m$分别是顶点和边的数量)。

英文摘要:

Consider a forest that evolves via $link$ operations that make the root of one tree the child of a node in another tree. Intermixed with $link$ operations are $nca$ operations, which return the nearest common ancestor of two given nodes when such exists. This paper shows that a sequence of $m$ such $nca$ and $link$ operations on a forest of $n$ nodes can be processed on-line in time $O(mα(m,n)+n)$. This was previously known only for a restricted type of $link$ operation. The special case where a $link$ only extends a tree by adding a new leaf occurs in Edmonds' algorithm for finding a maximum weight matching on a general graph. Incorporating our algorithm into the implementation of Edmonds' algorithm in \cite{G17} achieves time $O(n(m + n\log n))$ for weighted matching, an arguably optimum asymptotic bound ($n$ and $m$ are the number of vertices and edges, respectively).

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

↑