Conference paper
Bounded-diameter minimum spanning trees and related problems
Jan-Ming Ho, D.T. Lee, et al.
SCG 1989
The definition of binary split trees is generalized by removing the condition of decreasing frequency. It is shown that the access time of generalized split trees is less than that of split trees in general. The optimal representation of generalized split trees is studied. A polynomial time algorithm to construct such optimal tree structures is given. The relationship among several classes of binary trees are also discussed. © 1984 Springer-Verlag.
Jan-Ming Ho, D.T. Lee, et al.
SCG 1989
Xiaoyun Lu, Da-Wei Wang, et al.
Graphs and Combinatorics
Hongbing Fan, Yu-Liang Wu, et al.
Graphs and Combinatorics
Jin-Fuw Lee, D.L. Ostapko, et al.
IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers