On probability distributions of single-linkage dendrograms

References

• Cormack , R.M. 1971 . A review of classification . J. Royci Statist. Soc , A134 : 321 – 367 .
   Google Scholar
• Frank , O. 1978a . Estimation of the number of connected components in a graph by using a sampled subgraph . Scand .J. Statist , 5 : 177 – 188 .
   Web of Science ®Google Scholar
• Frank , O. . Inferences concerning cluster structures . Proceeding: in computational statistics . Wien. pp. 259 – 265 . Physica Verlag .
   Google Scholar
• Frank , O. 1979 . Estimating a graph from triad counts . J. Statist. Comput. Simul , 9 : 31 – 46 .
   Google Scholar
• Harary , F. 1969 . Graph Theory , Reading, Massachusetts : Addison-Wesley .
   Google Scholar
• Hartigan , J.A. 1975 . Clustering Algorithms , New York : Wiley .
   Google Scholar
• Ling , R.F. 1973 . A probability theory of cluster analysis . J. Amer. Statist. Assoc , 68 : 159 – 164 .
   Web of Science ®Google Scholar
• Ling , R.F. and Killough , G.G. 1976 . Probability tables for cluster analysis based on a theory of random graphs . J. Amer. Statist. Assoc , 71 : 293 – 300 .
   Web of Science ®Google Scholar
• Naus , J.I. 1979 . An indexed bibliography of clusters, clumps and coincidences . Int. Staibt. Rev , 47 : 47 – 78 .
   Web of Science ®Google Scholar
• Riordan , J. 1958 . An Introduction to Combinatorial Analysis , New York : Wiley .
   Google Scholar