Metraipolis › archive › dc_326ecf5abc67

Succinct Representation of Search Trees on Trees — arXiv:2609.21236

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21236
License (as archived)
CC0-1.0
Archived
2026-10-10T02:45:58.996Z
SHA-256 of the archived text
9ebcebdc8c687677a40a266905c29c426b5e8568631515eba4395ba6cbbd6444
Stable URL of this page
https://metraipolis.com/documento/dc_326ecf5abc67

How to cite

Succinct Representation of Search Trees on Trees — arXiv:2609.21236 — arXiv (en), https://arxiv.org/abs/2609.21236 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_326ecf5abc67 (Metraipolis archive dc_326ecf5abc67, sha256 9ebcebdc8c687677a40a266905c29c426b5e8568631515eba4395ba6cbbd6444)
BibTeX
@misc{dc326ecf5abc67,
  title = {Succinct Representation of Search Trees on Trees — arXiv:2609.21236},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21236},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_326ecf5abc67; sha256 9ebcebdc8c687677a40a266905c29c426b5e8568631515eba4395ba6cbbd6444},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21236. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A search tree on trees (STT) is a data structure for performing a search for a target vertex in a reference tree. A standard binary search tree is a special case of an STT, where the reference tree is a path of totally ordered elements. In this paper, we study the problem of succinct representation of STTs. We consider two cases: (1) general search trees on trees, and (2) Steiner-closed search trees on trees [Bose et al. TALG 2023]. For both cases, we present representations that can be constructed in polynomial time and achieve optimal space up to the lower-order additive terms. We also present data structures for supporting fast traversals of both general and Steiner-closed STTs. For general STTs our data structure still takes optimal space up to lower-order additive terms.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.21236 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T02:29:42.996Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).