FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

1996, VOLUME 2, NUMBER 2, PAGES 375-409

Minimal weighted planar binary trees

A. O. Ivanov

Abstract

View as HTML     View as gif image

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.

Location: http://mech.math.msu.su/~fpm/eng/96/962/96203h.htm
Last modified: March 19, 2005