Geodesic
Minimal weighted planar binary trees
Fundamentalʹnaâ i prikladnaâ matematika, Tome 2 (1996) no. 2, pp. 375-409 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The aim of the present work is to generalize the well known Melzak's algorithm and the notion of the twisting number to the case of weighted planar binary trees. That gives us the opportunity to obtain some essential restrictions to the possible topologies of minimal weighted planar binary trees. 
@article{FPM_1996_2_2_a2,
     author = {A. O. Ivanov},
     title = {Minimal weighted planar binary trees},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {375--409},
     year = {1996},
     volume = {2},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_1996_2_2_a2/}
}
TY  - JOUR
AU  - A. O. Ivanov
TI  - Minimal weighted planar binary trees
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 1996
SP  - 375
EP  - 409
VL  - 2
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/FPM_1996_2_2_a2/
LA  - ru
ID  - FPM_1996_2_2_a2
ER  - 
%0 Journal Article
%A A. O. Ivanov
%T Minimal weighted planar binary trees
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 1996
%P 375-409
%V 2
%N 2
%U http://geodesic.mathdoc.fr/item/FPM_1996_2_2_a2/
%G ru
%F FPM_1996_2_2_a2
A. O. Ivanov. Minimal weighted planar binary trees. Fundamentalʹnaâ i prikladnaâ matematika, Tome 2 (1996) no. 2, pp. 375-409. http://geodesic.mathdoc.fr/item/FPM_1996_2_2_a2/