Improving Walker’s Algorithm to Run in Linear Time

  • Christoph Buchheim
  • Michael Jünger
  • Sebastian Leipert
Conference paper

DOI: 10.1007/3-540-36151-0_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)
Cite this paper as:
Buchheim C., Jünger M., Leipert S. (2002) Improving Walker’s Algorithm to Run in Linear Time. In: Goodrich M.T., Kobourov S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Christoph Buchheim
    • 1
  • Michael Jünger
    • 1
  • Sebastian Leipert
    • 2
  1. 1.Institut für InformatikUniversität zu KölnKölnGermany
  2. 2.caesar research centerBonnGermany

Personalised recommendations