Succinct Euler-Tour Trees
Data Structures and Algorithms
2021-06-30 v2
Abstract
We show how a collection of Euler-tour trees for a forest on n vertices can be stored in 2n+o(n) bits such that simple queries take constant time, more complex queries take logarithmic time and updates take polylogarithmic amortized time.
Keywords
Cite
@article{arxiv.2105.04965,
title = {Succinct Euler-Tour Trees},
author = {Travis Gagie and Sebastian Wild},
journal= {arXiv preprint arXiv:2105.04965},
year = {2021}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Simple and Efficient Fully-Functional Succinct Trees
Joshimar Cordova, Gonzalo Navarro
2016-03-24
Data Structures and Algorithms · Computer Science
Load-Balancing Succinct B Trees
Tomohiro I, Dominik Köppl
2021-04-20
Data Structures and Algorithms · Computer Science
Fully-Functional Static and Dynamic Succinct Trees
Gonzalo Navarro, Kunihiko Sadakane
2010-09-27
Logic in Computer Science · Computer Science
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
Sarah Kleest-Meißner, Jonas Marasus, Matthias Niewerth
2025-10-08
Data Structures and Algorithms · Computer Science
Succinct Partial Sums and Fenwick Trees
Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen
2017-06-01
Combinatorics · Mathematics
Succinct Encodings of Binary Trees with Application to AVL Trees
Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun
2025-09-03
Algebraic Topology · Mathematics
Merge Trees of Periodic Filtrations
Herbert Edelsbrunner, Teresa Heiss
2024-08-30
Data Structures and Algorithms · Computer Science
Data Structures for Mergeable Trees
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert E. Tarjan +1
2007-11-13
Data Structures and Algorithms · Computer Science
Isometric-Universal Graphs for Trees
Edgar Baucher, François Dross, Cyril Gavoille
2025-06-17
Discrete Mathematics · Computer Science
Exact counting of Euler Tours for Graphs of Bounded Treewidth
Prasad Chebolu, Mary Cryan, Russell Martin
2013-10-02
Data Structures and Algorithms · Computer Science
Euclidean Prize-collecting Steiner Forest
MohammadHossein Bateni, MohammadTaghi Hajiaghayi
2009-12-08
Data Structures and Algorithms · Computer Science
Batch-Parallel Euler Tour Trees
Thomas Tseng, Laxman Dhulipala, Guy Blelloch
2022-03-08
Data Structures and Algorithms · Computer Science
Succinct data structure for dynamic trees with faster queries
Dekel Tsur
2018-05-30
Data Structures and Algorithms · Computer Science
A QUBO formulation for the Tree Containment problem
Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
2023-08-21
Data Structures and Algorithms · Computer Science
Representation of ordered trees with a given degree distribution
Dekel Tsur
2018-07-03
Artificial Intelligence · Computer Science
Logarithmic-Time Updates and Queries in Probabilistic Networks
Arthur L. Delcher, Adam J. Grove, Simon Kasif, Judea Pearl
2014-08-08
Data Structures and Algorithms · Computer Science
Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi
2025-11-11
Databases · Computer Science
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2019-08-28
Data Structures and Algorithms · Computer Science
Succinct data-structure for nearest colored node in a tree
Dekel Tsur
2017-02-21
Data Structures and Algorithms · Computer Science
Novel O(H(N)+N/H(N)) Algorithmic Techniques for Several Types of Queries and Updates on Rooted Trees and Lists
Mugurel Ionut Andreica
2013-03-25
Data Structures and Algorithms · Computer Science
Dynamic Treewidth in Logarithmic Time
Tuukka Korhonen
2025-04-14
Computational Geometry · Computer Science
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2013-05-02
Data Structures and Algorithms · Computer Science
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Jérémy Barbay, Johannes Fischer
2010-09-30
Data Structures and Algorithms · Computer Science
On Succinct Representations of Binary Trees
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
2014-10-21
Data Structures and Algorithms · Computer Science
Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
William Kuszmaul, Jingxun Liang, Renfei Zhou
2025-10-23