Optimal generation of strictly increasing binary trees and beyond

DOI10.4204/EPTCS.403.15MaRDI QIDQ6934116zbMATH OpenFDO

Authors Olivier Bodini, Francis Durand, Philippe Marchal

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.403.15

zbMATH Keywords

random increasing treesweighted strictly increasing unary-binary increasing trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Efficient random sampling of binary and unary-binary trees via holonomic equations

Cited in

(1)

• Direct sampling of confined polygons in linear time

This page was built for publication: Optimal generation of strictly increasing binary trees and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934116)