Generating binary trees with uniform probability

DOI10.1007/BF01952779MaRDI QIDQ751300zbMATH OpenFDO

Authors Ben Johnsen

Publication date 1991

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01952779

zbMATH Keywords

Bernoulli polynomialsbinary treeCatalan numbersenumerationMarkov chain

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05)

Recommendations

• The generation of binary trees as a numerical problem
• The generation of random, binary unordered trees
• Fast random generation of binary, t-ary and other types of trees
• A linear-time algorithm for the generation of trees
• Generating binary trees at random

Cites work

• A numbering system for binary trees
• Efficient algorithms for tree reconstruction

Cited in

(5)

• Random generation of trees and other combinatorial objects
• Generating random binary trees -- a survey
• Atoms, binary trees and dichotomic non-Markovian processes
• Constructing a binary tree efficiently from its traversals
• scientific article; zbMATH DE number 1774280 (Why is no real title available?)

This page was built for publication: Generating binary trees with uniform probability

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