Improving Walker's Algorithm to Run in Linear Time

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. [Preprint]

WarningThere is a more recent version of this item available.
[img] Other
Download (84kB)

Abstract

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.

Item Type: Preprint
Classifications: P Styles > P.720 Straight-line
M Methods > M.900 Tree
URI: http://gdea.informatik.uni-koeln.de/id/eprint/12

Available Versions of this Item

Actions (login required)

View Item View Item