Optimal Generation of Strictly Increasing Binary Trees and Beyond
Data Structures and Algorithms
2024-06-25 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2406.16396,
title = {Optimal Generation of Strictly Increasing Binary Trees and Beyond},
author = {Olivier Bodini and Francis Durand and Philippe Marchal},
journal= {arXiv preprint arXiv:2406.16396},
year = {2024}
}
Comments
In Proceedings GASCom 2024, arXiv:2406.14588