“Minimax length links” of a dissimilarity matrix and minimum spanning trees
暂无分享,去创建一个
[1] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[2] R. Prim. Shortest connection networks and some generalizations , 1957 .
[3] S. C. Johnson. Hierarchical clustering schemes , 1967, Psychometrika.
[4] J. Gower,et al. Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .
[5] John A. Hartigan,et al. Clustering Algorithms , 1975 .
[6] D. W. Dearholt,et al. Graph theoretic foundations of pathfinder networks , 1988 .
[7] K. C. Klauer. Ordinal network representation: Representing proximities by graphs , 1989 .
[8] Karl Christoph Klauer,et al. A mathematical programming approach to fitting general graphs , 1989 .
[9] J. W. Hutchinson. Netscal: A network scaling algorithm for nonsymmetric proximity data , 1989 .
[10] D. W. Dearholt,et al. Properties of pathfinder networks , 1990 .
[11] Karl Christoph Klauer,et al. A comparison of two approaches to fitting directed graphs to nonsymmetric proximity measures , 1991 .