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

DOI10.1007/BF02294381zbMATH Open0864.92020OpenAlexW2147395592MaRDI QIDQ676486FDOQ676486

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1163859
• Minimum spanning trees and types of dissimilarities
• On the difference of expected lengths of minimum spanning trees
• Minimum spanning trees in \(d\) dimensions
• scientific article; zbMATH DE number 1436136
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• scientific article; zbMATH DE number 2065879
• Minimum Diameter Spanning Trees and Related Problems
• scientific article; zbMATH DE number 1984546

zbMATH Keywords

hierarchical clusteringproximity datanetwork modelsminimum spanning treessingle linkage clusteringdissimilarity datamaximum length of linksminimax linksPathfindersingle linkage hierarchical treesundirected weighted graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Hierarchical clustering schemes
• Graph theoretic foundations of pathfinder networks
• Ordinal network representation: Representing proximities by graphs

Cited In (5)

• Graph theoretic foundations of pathfinder networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A ``maximum-path-based classification

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676486)