We show how a collection of Euler-tour trees for a forest on $n$ vertices can be stored in $2 n + o (n)$ bits such that simple queries take constant time, more complex queries take logarithmic time and updates take polylogarithmic amortized time.

翻译：我们展示如何将一棵以美元为顶点的森林的Euler-tour树群储存在$2 n+ o(n) 位元中,这样简单的查询需要固定时间,更复杂的查询需要对数时间,更新需要多面振动时间。