Lecture Notes in Computer Science Volume 2528, 2002, pp 344-353
Date: 08 Nov 2002

Improving Walker’s Algorithm to Run in Linear Time

* Final gross prices may vary according to local VAT.

Get Access

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.