-
2
-
-
0038967743
-
Symmetric matrices representable by weighted trees over a cancellative abelian monoid
-
Bandelt H.-J., Steel M. A. Symmetric matrices representable by weighted trees over a cancellative abelian monoid. SIAM J. Discrete Math. 8:1995;517-525.
-
(1995)
SIAM J. Discrete Math.
, vol.8
, pp. 517-525
-
-
Bandelt, H.-J.1
Steel, M.A.2
-
3
-
-
0040165718
-
Approximation des dissimilarités par des abres additifs
-
Brossier G. Approximation des dissimilarités par des abres additifs. Math. Sci. Humaines. 91:1985;5-21.
-
(1985)
Math. Sci. Humaines
, vol.91
, pp. 5-21
-
-
Brossier, G.1
-
4
-
-
0001925593
-
A note on the metric property of trees
-
Buneman P. A note on the metric property of trees. J. Combin. Theory Ser. B. 17:1974;48-50.
-
(1974)
J. Combin. Theory Ser. B
, vol.17
, pp. 48-50
-
-
Buneman, P.1
-
6
-
-
0001481555
-
Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorical properties of metric spaces
-
Dress A. W. M. Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorical properties of metric spaces. Adv. Math. 53:1984;321-402.
-
(1984)
Adv. Math
, vol.53
, pp. 321-402
-
-
Dress, A.W.M.1
-
9
-
-
0001715023
-
A review of hierarchical classification
-
Gordon A. D. A review of hierarchical classification. J. Roy. Statist. Soc. Ser. A. 150:1987;119-137.
-
(1987)
J. Roy. Statist. Soc. Ser. a
, vol.150
, pp. 119-137
-
-
Gordon, A.D.1
-
10
-
-
21844524668
-
Minimum spanning trees for tree metrics: Abrigements and adjustments
-
Leclerc B. Minimum spanning trees for tree metrics: Abrigements and adjustments. J. Classification. 12:1995;207-241.
-
(1995)
J. Classification
, vol.12
, pp. 207-241
-
-
Leclerc, B.1
-
11
-
-
0000503301
-
A note on the tree realizability of a distance matrix
-
Simões Pereira J. M. S. A note on the tree realizability of a distance matrix. J. Combin. Theory. 6:1969;303-310.
-
(1969)
J. Combin. Theory
, vol.6
, pp. 303-310
-
-
Simões Pereira, J.M.S.1
-
12
-
-
0002275128
-
Constructing trees from the set of distances between pendant vertices
-
Zaretskii K. A. Constructing trees from the set of distances between pendant vertices. Uspehi Matematiceskih Nauk. 20:1965;90-92.
-
(1965)
Uspehi Matematiceskih Nauk
, vol.20
, pp. 90-92
-
-
Zaretskii, K.A.1
|