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

实践中的静态水平祖先

Static Level Ancestors in Practice

Matthew Mabrey, Thomas Caputi, Georgios Papamichail, Dimitris Papamichail

摘要:

给定一个根树T,级别祖先问题的目的是回答形式LA(v,d)的查询,它标识树中节点v的级别d祖先。在文献中已经提出了几种不同复杂度的算法来解决这个问题,包括在线性有界时间内预处理树$T$并在恒定时间内回答查询的最优解。尽管其意义和众多的应用,迄今为止,还没有这些算法的性能进行比较研究,很少有实现广泛提供。在我们的实验研究中,我们实现和比较了几个解决方案的水平祖先问题,包括三个理论上最优的算法,并检查其在实践中的空间需求和时间性能。

英文摘要:

Given a rooted tree T, the level ancestor problem aims to answer queries of the form LA(v, d), which identify the level d ancestor of a node v in the tree. Several algorithms of varied complexity have been proposed for this problem in the literature, including optimal solutions that preprocess the tree $T$ in linear bounded time and proceed to answer queries in constant time. Despite its significance and numerous applications, to date there have been no comparative studies of the performance of these algorithms and few implementations are widely available. In our experimental study we implemented and compared several solutions to the level ancestor problem, including three theoretically optimal algorithms, and examined their space requirements and time performance in practice.

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

↑