Succinct Euler-Tour Trees
Travis Gagie, Sebastian Wild

TL;DR
This paper presents a space-efficient data structure for Euler-tour trees that enables fast queries and updates on forests, significantly reducing memory usage while maintaining performance.
Contribution
It introduces a novel succinct representation of Euler-tour trees that supports efficient operations with minimal space overhead.
Findings
Uses 2n + o(n) bits for storage
Supports constant-time simple queries
Supports polylogarithmic amortized updates
Abstract
We show how a collection of Euler-tour trees for a forest on vertices can be stored in bits such that simple queries take constant time, more complex queries take logarithmic time and updates take polylogarithmic amortized time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · Cellular Automata and Applications
