``Minimax length links of a dissimilarity matrix and minimum spanning trees
From MaRDI portal
Publication:676486
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
Cites work
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- Graph theoretic foundations of pathfinder networks
- Hierarchical clustering schemes
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Ordinal network representation: Representing proximities by graphs
Cited in
(5)- Graph theoretic foundations of pathfinder networks
- A ``maximum-path-based classification
- scientific article; zbMATH DE number 4130396 (Why is no real title available?)
- scientific article; zbMATH DE number 61573 (Why is no real title available?)
- scientific article; zbMATH DE number 2058249 (Why is no real title available?)
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)