Graph Drawing

Volume 2528 of the series Lecture Notes in Computer Science pp 344-353


Improving Walker’s Algorithm to Run in Linear Time

  • Christoph BuchheimAffiliated withInstitut für Informatik, Universität zu Köln
  • , Michael JüngerAffiliated withInstitut für Informatik, Universität zu Köln
  • , Sebastian LeipertAffiliated withcaesar research center

* Final gross prices may vary according to local VAT.

Get Access


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.