The generation of random, binary unordered trees

DOI10.1007/BF01890123MaRDI QIDQ1068492zbMATH OpenFDO

Authors George W. Furnas

Publication date 1984

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

zbMATH Keywords

computational complexityuniform samplingclustering methodologytree algorithmstree constructionclassification methodologycompletely labelledrandom generation of binary treesterminally labelledunlabelled

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Monte Carlo methods (65C05) Combinatorial probability (60C05)

Recommendations

• Fast random generation of binary, t-ary and other types of trees
• The generation of binary trees as a numerical problem
• Generating random binary trees -- a survey
• Random generation of trees and other combinatorial objects
• Uniform generation of binary trees in parallel

Cites work

• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3390780 (Why is no real title available?)
• scientific article; zbMATH DE number 3400297 (Why is no real title available?)
• A Probability theory of hierarchic clustering using random dendrograms
• A numbering system for binary trees
• An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes
• An extremal problem on random trees
• Coding and generation of nonisomorphic trees
• Constant Time Generation of Rooted Trees
• Counting dendrograms: A survey
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Generating t-Ary Trees Lexicographically
• Generating Binary Trees Lexicographically
• Generating Trees and Other Combinatorial Objects Lexicographically
• Generation of Binary Trees from Ballot Sequences
• Numbering binary trees with labeled terminal vertices
• On probability distributions of single-linkage dendrograms
• Ranking and Listing Algorithms for k-Ary Trees
• Spatial versus tree representations of proximity data
• The distance between points in random trees
• The distribution of degrees in a large random tree
• The probabilities of rooted tree-shapes generated by random bifurcation

Cited in

(23)

• A Comparison of Random Binary Tree Generators
• Fast random generation of binary, t-ary and other types of trees
• An empirical comparison of permutation methods for tests of partial regression coefficients in a linear model
• Comparison of permutation methods for the partial correlation and partial mantel tests
• On trees, tanglegrams, and tangled chains
• On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis
• Generating binary trees with uniform probability
• scientific article; zbMATH DE number 3994870 (Why is no real title available?)
• Random generation using binomial approximations
• Mean deep coalescence cost under exchangeable probability distributions
• Improved metaheuristics for the quartet method of hierarchical clustering
• Efficient random sampling of binary and unary-binary trees via holonomic equations
• Generating random binary trees -- a survey
• scientific article; zbMATH DE number 168426 (Why is no real title available?)
• On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees
• Holonomic equations and efficient random generation of binary trees
• Binarization Trees and Random Number Generation
• Uniform generation of binary trees in parallel
• Generating ordered trees
• Probabilistic models in cluster analysis
• An exact algorithm for the minimum quartet tree cost problem
• On the enumeration of tanglegrams and tangled chains
• A note on Rémy's algorithm for generating random binary trees

This page was built for publication: The generation of random, binary unordered trees

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