Fast random generation of binary, t-ary and other types of trees

DOI10.1007/BF01908600zbMATH Open0691.68019MaRDI QIDQ582880FDOQ582880

Authors: A. J. Quiroz 

Publication date: 1989

Published in: Journal of Classification (Search for Journal in Brave)

Recommendations

• A linear-time algorithm for the generation of trees
• The generation of random, binary unordered trees
• The generation of binary trees as a numerical problem
• Generating random binary trees -- a survey
• Generating binary trees at random

zbMATH Keywords

clustering methodologyMonte Carlo studiestree algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The distribution of degrees in a large random tree
• The generation of random, binary unordered trees
• Title not available (Why is that?)
• The distance between points in random trees
• Ranking and Listing Algorithms for k-Ary Trees
• Generating t-Ary Trees Lexicographically
• An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes

Cited In (16)

• Generating random binary trees -- a survey
• Random generation of colored trees
• Title not available (Why is that?)
• Birth and death chains on finite trees: computing their stationary distribution and hitting times
• Growing random uniform \(d\)-ary trees
• Fast generation of unlabelled free trees using weight sequences
• Generating binary trees at random
• On Generating Random Network Structures: Trees
• Generating binary trees with uniform probability
• Uniform generation of forests of restricted height
• Uniform generation of binary trees in parallel
• Title not available (Why is that?)
• The generation of random, binary unordered trees
• Binarization Trees and Random Number Generation
• Generating strictly binary trees at random based on convex polygon triangulations
• Probabilistic models in cluster analysis

This page was built for publication: Fast random generation of binary, t-ary and other types of trees

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