Optimal Generation of Strictly Increasing Binary Trees and Beyond
<|reference_start|>Optimal Generation of Strictly Increasing Binary Trees and Beyond: 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.<|reference_end|>
@article{bodini2024optimal,
    title={Optimal Generation of Strictly Increasing Binary Trees and Beyond},
    author={Olivier Bodini (LIPN), Francis Durand (LIPN), Philippe Marchal (LAGA)},
    journal={EPTCS 403, 2024, pp. 60-65},
    year={2024},
    doi={10.4204/EPTCS.403.15},
    archivePrefix={arXiv},
    eprint={2406.16396},
    primaryClass={cs.DS cs.DM}
}