Acta Informatica

, Volume 40, Issue 8, pp 603–607 | Cite as

On the complexity of drawing trees nicely: corrigendum

  • Thorsten Akkerman
  • Christoph Buchheim
  • Michael Jünger
  • Daniel Teske
Article

Abstract.

In this journal, Supowit and Reingold [1] have given a proof that it is NP-complete to decide whether a binary tree can be drawn on a grid with width 24 if certain æsthetic requirements are obeyed. We identify and repair a mistake in their proof.

Keywords

Binary Tree Drawing Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Supowit J., Reingold, E. M.: The complexity of drawing trees nicely. Acta Informatica 18, 377-392 (1983)Google Scholar

Copyright information

© Springer-Verlag Berlin/Heidelberg 2004

Authors and Affiliations

  • Thorsten Akkerman
    • 1
  • Christoph Buchheim
    • 1
  • Michael Jünger
    • 1
  • Daniel Teske
    • 1
  1. 1.Institut für InformatikUniversität zu KölnKölnGermany

Personalised recommendations