학술논문
Succinct Euler-Tour Trees
Document Type
Working Paper
Author
Source
Subject
Language
Abstract
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.