The generation of random, binary unordered trees

DOI10.1007/BF01890123zbMath0582.62052MaRDI QIDQ1068492

George W. Furnas

Publication date: 1984

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

zbMATH Keywords

computational complexityuniform samplingtree algorithmstree constructionclustering methodologyclassification 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)

Related Items (12)

Comparison of permutation methods for the partial correlation and partial mantel tests ⋮ On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis ⋮ Probabilistic models in cluster analysis ⋮ On the enumeration of tanglegrams and tangled chains ⋮ On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees ⋮ Mean deep coalescence cost under exchangeable probability distributions ⋮ Improved metaheuristics for the quartet method of hierarchical clustering ⋮ Fast random generation of binary, t-ary and other types of trees ⋮ An exact algorithm for the minimum quartet tree cost problem ⋮ Unnamed Item ⋮ Generating random binary trees -- a survey ⋮ An empirical comparison of permutation methods for tests of partial regression coefficients in a linear model

Cites Work

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

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