D.T. Lee, C.D. Yang, et al.
International Journal of Computational Geometry and Applications
Paper
Generalized binary split trees
Abstract
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.
Related
Majid Sarrafzadeh, C.K. Wong
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
D.T. Tang, C.K. Wong
Information Processing Letters
Conference paper
Provably good algorithms for performance-driven global routing
J. Cong, A. Kahng, et al.
ISCAS 1992