``Minimax length links'' of a dissimilarity matrix and minimum spanning trees (Q676486): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4148820 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hierarchical clustering schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordinal network representation: Representing proximities by graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph theoretic foundations of pathfinder networks / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02294381 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2147395592 / rank | |||
Normal rank | |||
Latest revision as of 12:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ``Minimax length links'' of a dissimilarity matrix and minimum spanning trees |
scientific article |
Statements
``Minimax length links'' of a dissimilarity matrix and minimum spanning trees (English)
0 references
29 April 1997
0 references
minimax links
0 references
Pathfinder
0 references
hierarchical clustering
0 references
proximity data
0 references
maximum length of links
0 references
undirected weighted graph
0 references
minimum spanning trees
0 references
network models
0 references
dissimilarity data
0 references
single linkage clustering
0 references
single linkage hierarchical trees
0 references
