Alphabetic minimax trees of degree at most t. (English) Zbl 0587.94019
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.
MSC:
94C10 | Switching theory, application of Boolean algebra; Boolean functions (MSC2010) |
94C15 | Applications of graph theory to circuits and networks |