Minimum spanning trees for tree metrics: abridgements and adjustments
Year of publication: |
1995
|
---|---|
Authors: | Leclerc, Bruno |
Published in: |
Journal of Classification. - Springer. - Vol. 12.1995, 2, p. 207-241
|
Publisher: |
Springer |
Subject: | Tree metric | Ultrametric | Robinson dissimilarity | Dissimilarity | Graph | Tree | Minimum spanning tree | Fitting algorithm | Combinatorial data analysis |
-
Hierarchical trees can be perfectly scaled in one dimension
Critchley, Frank, (1988)
-
Carroll, J., (1995)
-
Compact integer-programming models for extracting subsets of stimuli from confusion matrices
Brusco, Michael, (2001)
- More ...
-
Monjardet, Bernard, (2009)
-
Leclerc, Bruno, (2011)
-
On the use of ordered sets in problems of comparison and consensus of classifications
Barthélemy, Jean-Pierre, (1986)
- More ...