Succinct Euler-Tour Trees
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.