A node-positioning algorithm for general trees
Software—Practice & Experience
On Finding Lowest Common Ancestors: Simplification and Parallelization
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Algorithms and theory of computation handbook
ADTool: security analysis with attack---defense trees
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
The aim of automatic graph drawing is the development of algorithms for creating nice and easily readable layouts of abstractly given graphs. For the special case of rooted trees of unbounded degree, John Q. Walker II presented a drawing algorithm in this journal in 1990. This algorithm is an extension of the Reingold–Tilford algorithm. It yields very good results and is therefore widely used. Furthermore, it is widely assumed to run in linear time, as the author claims in his article. However, the algorithm in its presented form clearly needs quadratic runtime. We explain the reasons for that and state a revised algorithm that creates the same layouts in linear time. Copyright © 2006 John Wiley & Sons, Ltd.