Document Type

Article

Department

Mathematics (HMC)

Publication Date

1986

Abstract

Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction.

Rights Information

© 1986 Society for Industrial and Applied Mathematics