Optimal Generation of Strictly Increasing Binary Trees and Beyond
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913402628079616 |
|---|---|
| author | Bodini, Olivier Durand, Francis Marchal, Philippe |
| author_facet | Bodini, Olivier Durand, Francis Marchal, Philippe |
| contents | This article presents two novel algorithms for generating random increasing trees. The first algorithm efficiently generates strictly increasing binary trees using an ad hoc method. The second algorithm improves the recursive method for weighted strictly increasing unary-binary increasing trees, optimizing randomness usage.
|
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16396 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal Generation of Strictly Increasing Binary Trees and Beyond Bodini, Olivier Durand, Francis Marchal, Philippe Data Structures and Algorithms Discrete Mathematics This article presents two novel algorithms for generating random increasing trees. The first algorithm efficiently generates strictly increasing binary trees using an ad hoc method. The second algorithm improves the recursive method for weighted strictly increasing unary-binary increasing trees, optimizing randomness usage. |
| title | Optimal Generation of Strictly Increasing Binary Trees and Beyond |
| topic | Data Structures and Algorithms Discrete Mathematics |
| url | https://arxiv.org/abs/2406.16396 |