``Minimax length links of a dissimilarity matrix and minimum spanning trees

DOI10.1007/BF02294381zbMath0864.92020OpenAlexW2147395592MaRDI QIDQ676486

J. Douglas Carroll

Publication date: 29 April 1997

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02294381

zbMATH Keywords

hierarchical clusteringminimum spanning treesnetwork modelsproximity datasingle linkage clusteringdissimilarity datamaximum length of linksminimax linksPathfindersingle linkage hierarchical treesundirected weighted graph

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Applications of graph theory (05C90) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Graph theoretic foundations of pathfinder networks
• Hierarchical clustering schemes
• Ordinal network representation: Representing proximities by graphs

This page was built for publication: ``Minimax length links of a dissimilarity matrix and minimum spanning trees