更简单的静态水平祖先
Still Simpler Static Level Ancestors
摘要:
关于有根树$T$的级别祖先或LA查询将$T$中的节点$v$(例如深度为$d_v$)和具有$0\le d\le d_v$的整数$d$作为参数,并返回深度为$d$的$T$中的$v$的祖先。静态LA问题是处理给定的根树$T$,以便支持关于$T$的LA查询的高效后续处理。静态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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。