论文标题
仍然更简单的静态祖先
Still Simpler Static Level Ancestors
论文作者
论文摘要
关于根本树$ t $的级别 - comestor或la查询，作为参数a节点$ v $ in $ t $，tepth $ d_v $，例如$ d_v $，以及$ 0 \ le d \ le d \ le d_v $的整数$ d $，并返回了$ v $ in $ v $ in $ v $ in $ v $。静态LA问题是处理给定的生$ t $，以支持有效的随后处理LA查询大约$ t $。将问题的所有有效解决方案用于静态LA问题的工作，将问题的实例减少到相同或相关问题的较小实例，并以效率较低的数据结构解决，并收集了为提供不同解决方案的小型微型实现。我们指出了直接起作用的静态LA问题的第一个有效解决方案，而无需诉诸降低或微型固定。
A level-ancestor or LA query about a rooted tree $T$ takes as arguments a node $v$ in $T$, of depth $d_v$, say, and an integer $d$ with $0\le d\le d_v$ and returns the ancestor of $v$ in $T$ of depth $d$. The static LA problem is to process a given rooted tree $T$ so as to support efficient subsequent processing of LA queries about $T$. All previous efficient solutions to the static LA problem work by reducing a given instance of the problem to a smaller instance of the same or a related problem, solved with a less efficient data structure, and a collection of small micro-instances for which a different solution is provided. We indicate the first efficient solution to the static LA problem that works directly, without resorting to reductions or micro-instances.
