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

到静态水平-祖先的欧拉路径

The Euler Path to Static Level-Ancestors

Amir M. Ben-Amram

摘要:

假设给定一棵有根树T用于预处理。水平祖先问题是快速回答以下形式的问题。给定顶点v和整数i > 0,找到从根到v的路径上的第i个顶点。实现预处理的线性时间界限和查询的恒定时间界限的算法已经由Dietz(1991),Alstrup和Holm(2000)以及Bender和Farach(2002)发表。前两个算法解决问题的动态版本;最后一个只解决静态版本,是迄今为止最简单的。本文的目的是揭示另一种简单的算法,它是由Berkman和Vishkin(1990,1994)的复杂PRAM算法衍生而来的。我们进一步展示了一些简单的扩展其功能,添加查询的后代和水平的继任者以及祖先,扩展,以前已知的算法是不太合适的。

英文摘要:

Suppose that a rooted tree T is given for preprocessing. The Level-Ancestor Problem is to answer quickly queries of the following form. Given a vertex v and an integer i > 0, find the i-th vertex on the path from the root to v. Algorithms that achieve a linear time bound for preprocessing and a constant time bound for a query have been published by Dietz (1991), Alstrup and Holm (2000), and Bender and Farach (2002). The first two algorithms address dynamic versions of the problem; the last addresses the static version only and is the simplest so far. The purpose of this note is to expose another simple algorithm, derived from a complicated PRAM algorithm by Berkman and Vishkin (1990,1994). We further show some easy extensions of its functionality, adding queries for descendants and level successors as well as ancestors, extensions for which the formerly known algorithms are less suitable.

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

↑