ON ALPHABETIC-EXTENDED BINARY TREES WITH RESTRICTED PATH LENGTH
Ang J · 1979
As a continuation of [3], this paper is concerned with L-restricted alphabetic-extended binary trees with cost function and transfer function. The main results obtained here are three theorems (Theorems 2, 3 and 4) on the separating number, whereas Theorem 1 on identity of optimal solutions of models 1 and 2 would constitute a theoretical basis to establish recurrence formula and define separating number.