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 quadraticruntime. We explain the reasons for that and present a revised algorithm that creates the same layouts in linear time. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Buchheim, C., Jünger, M., & Leipert, S. (2002). Improving Walker’s algorithm to run in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 344–353). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
