An improved generalized tree layout algorithm
Xiaohong Li, Jingwei Huang · 2010
Generalized tree is a more practical tree. A good layout of a generalized tree is accordingly of very high application value. With the definitions of a node's WPL (weighted path length) and the left or right contour in a generalized tree, an improved generalized tree layout algorithm is proposed. The algorithm has both the time and space complexities of O(n) and improves the Bloesch's algorithm which has both the complexities of O(h · n) .