arXiv Open Access 2021

Succinct Euler-Tour Trees

Travis Gagie Sebastian Wild

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (2)

Travis Gagie

Sebastian Wild

Format Sitasi

APA MLA BibTeX

Gagie, T., Wild, S. (2021). Succinct Euler-Tour Trees. https://arxiv.org/abs/2105.04965

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2021
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓