Minimization of the Partially-Developed Transfer Tree

A transfer tree is a particular type of multiterminal network having a single input which may be connected to any one of a number of outputs. An n-relay transfer tree is partially developed if it has less than the 2n possible output terminals. Rearrangement of a partially-developed tree can lead to a reduction in the total number of transfers required. This paper presents a method of obtaining a required partially-developed transfer tree with the minimum number of transfers.