THE GENERATION OF RANDOM, BINARY UNORDERED TREES

被引：48
作者：
FURNAS, GW
机构：
来源：
JOURNAL OF CLASSIFICATION | 1984年 / 1卷 / 2-3期
关键词：
D O I：
10.1007/BF01890123
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：187 / 233
页数：47
相关论文
共 38 条
[1]   CONSTANT TIME GENERATION OF ROOTED TREES [J].
BEYER, T ;
HEDETNIEMI, SM .
SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :706-712
[2]  
CARROLL JD, 1974, UNPUB ANN M CLASSIFI
[3]  
CARROLL JD, 1973, 81ST P ANN CONV AM P, V8, P1097
[4]  
Comtet L., 1970, ADV COMBINATORICS
[5]   THE ESTIMATION OF ULTRAMETRIC AND PATH-LENGTH TREES FROM RECTANGULAR PROXIMITY DATA [J].
DESOETE, G ;
DESARBO, WS ;
FURNAS, GW ;
CARROLL, JD .
PSYCHOMETRIKA, 1984, 49 (03) :289-310
[6]  
DINITS EA, 1977, AUTOMAT REM CONTR, V4, P554
[7]   NUMBER OF EVOLUTIONARY TREES [J].
FELSENSTEIN, J .
SYSTEMATIC ZOOLOGY, 1978, 27 (01) :27-33
[8]  
FOWLKES EB, 1982, UNPUB SOME METHODS S
[9]   ON PROBABILITY-DISTRIBUTIONS OF SINGLE-LINKAGE DENDROGRAMS [J].
FRANK, O ;
SVENSSON, K .
JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 1981, 12 (02) :121-131
[10]  
FURNAS GW, 1981, UNPUB CONSTRUCTION R
1234