Title :
An improved generalized tree layout algorithm
Author :
Xiaohong, Li ; Jingwei, Huang
Author_Institution :
Sch. of Comput., Wuhan Univ., Wuhan, China
Abstract :
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).
Keywords :
computational complexity; trees (mathematics); Bloesch algorithm; improved generalized tree layout algorithm; space complexities; time complexities; weighted path length; Application software; Asia; Automatic control; Binary trees; Informatics; Information security; Laboratories; Robot control; Robotics and automation; Tree graphs; complexity; generalized tree; tree layout algorithm;
Conference_Titel :
Informatics in Control, Automation and Robotics (CAR), 2010 2nd International Asia Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5192-0
Electronic_ISBN :
1948-3414
DOI :
10.1109/CAR.2010.5456745
