Improving Walker's Algorithm to Run in Linear Time
Christoph Buchheim, Michael Jünger, Sebastian Leipert · Computer Science Publication Server (University of Cologne) · 2002
The algorithm of Walker 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 obviously needs quadratic runtime. We explain the reasons for that and present a revised algorithm that creates the same layouts in linear time.