Abstract
The algorithm of Walker [5] is widely used for drawing trees of unbounded degree, and it is widely assumed to run in linear time, as the author claims in his article. But the presented algorithm clearly needs quadraticrun time. We explain the reasons for that and present a revised algorithm that creates the same layouts in linear time.
Chapter PDF
Similar content being viewed by others
References
C. Buchheim, M. Jünger, and S. Leipert. Improving Walker’s algorithm to run in linear time. Technical Report zaik2002-431, ZAIK, Universität zu Köln, 2002.
E. Reingold and J. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, 7(2):223–228, 1981.
B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. In Proceedings of the Third Aegean Workshop on Computing, volume 319 of Lecture Notes in Computer Science, pages 111–123, 1988.
K. Supowit and E. Reingold. The complexity of drawing trees nicely. Acta Informatica, 18(4):377–392, 1983.
J. Walker II. A node-positioning algorithm for general trees. Software-Practice and Experience, 20(7):685–705, 1990.
C. Wetherell and A. Shannon. Tidy drawings of trees. IEEE Transactions on Software Engineering, 5(5):514–520, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchheim, C., Jünger, M., Leipert, S. (2002). Improving Walker’s Algorithm to Run in Linear Time. In: Goodrich, M.T., Kobourov, S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36151-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-36151-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00158-4
Online ISBN: 978-3-540-36151-0
eBook Packages: Springer Book Archive