Uniform generation of forests of restricted height

DOI10.1016/0020-0190(94)00054-9MaRDI QIDQ1330666zbMATH OpenOpenAlexWikidataFDO

Authors Michael D. Atkinson, Jörg-Rüdiger Sack

Publication date 21 July 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)00054-9

zbMATH Keywords

analysis of algorithmsdesign of algorithmsforestsinformation storagerandom generationtrees

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A linear-time algorithm for the generation of trees
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• The generation of binary trees as a numerical problem
• Fast random generation of binary, t-ary and other types of trees
• Enumerating k-way trees

Cites work

• A method and two algorithms on the theory of partitions
• Counting and randomly generating binary trees
• Generating binary trees at random
• Generating binary trees of bounded height
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• On Random Binary Trees
• The average height of binary trees and other simple trees
• The generation of binary trees as a numerical problem
• Uniform Random Generation of Strings in a Context-Free Language

Cited in

(4)

• Enumerating k-way trees
• A workbench for computational geometry
• Uniformly Discrete Forests with Poor Visibility
• Algorithms and Computation

This page was built for publication: Uniform generation of forests of restricted height

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