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

Level Ancestors 的更简单 O(1) 查询算法

Simpler O(1) Query Algorithm for Level Ancestors

Sanjeev Saxena

AI总结:

本文提出一种用于查找 level ancestors 的简单 O(1) 查询时间算法,通过增加层级或表查找将预处理时间降至线性,并能简化 Berkman 和 Vishkin 的并行算法使其达到最优。

摘要:

本笔记描述了一种用于查找 level ancestors 的非常简单的 O(1) 查询时间算法。这基本上是 Berkman 和 Vishkin 的并行算法(O.Berkman 和 U.Vishkin,Finding level-ancestors in trees,JCSS,48,214--230,1994)的串行(重新)实现。尽管基本算法的预处理时间为 O(n log n),但通过增加额外层级或使用表查找,预处理时间可以降低至几乎线性或线性。表查找算法可以在使用 $n$ 个处理器的 O(1) 并行时间内构建,也可用于简化 Berkman 和 Vishkin 的并行算法并使其达到最优。

英文摘要:

This note describes a very simple O(1) query time algorithm for finding level ancestors. This is basically a serial (re)-implementation of the parallel algorithm of Berkman and Vishkin (O.Berkman and U.Vishkin, Finding level-ancestors in trees, JCSS, 48, 214--230, 1994). Although the basic algorithm has preprocessing time of O(n log n), by having additional levels or using table lookup, the preprocessing time can be reduced to almost linear or linear. The table lookup algorithm can be built in O(1) parallel time with $n$ processors and can also be used to simplify the parallel algorithm of Berkman and Vishkin and make it optimal.

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

↑