On the complexity of drawing trees nicely: corrigendum
In this journal, Supowit and Reingold  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.
KeywordsBinary Tree Drawing Tree
Unable to display preview. Download preview PDF.
- 1.Supowit J., Reingold, E. M.: The complexity of drawing trees nicely. Acta Informatica 18, 377-392 (1983)Google Scholar