Linear random generation of Motzkin trees

05/23/2022
by   Pierre Lescanne, et al.
0

Motzkin trees are also called unary-binary trees. This paper proposes a linear algorithm for uniform random generation of Motzkin trees. The algorithm uses the same paradigm as this of Rémy's linear algorithm for random generation of binary trees and is based on a preliminary computation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2020

Fast Generation of Big Random Binary Trees

random_tree() is a linear time and space C++ implementation able to crea...
research
12/22/2021

An algorithm for generating random mixed-arity trees

Inspired by [4] we present a new algorithm for uniformly random generati...
research
07/11/2018

Trees in the Real Field

This paper proposes an algebraic view of trees which opens the doors to ...
research
09/01/2023

Approximate Bayesian computation for Markovian binary trees in phylogenetics

Phylogenetic trees describe the relationships between species in the evo...
research
07/06/2018

Decentralised Random Number Generation

Decentralised random number generation algorithms suffer from the Last A...
research
04/22/2019

Clifford algebras, Spin groups and qubit trees

Representations of Spin groups and Clifford algebras derived from struct...
research
12/23/2017

Cartesian trees and Lyndon trees

The article describes the structural and algorithmic relations between C...

Please sign up or login with your details

Forgot password? Click here to reset