On the complexity of drawing trees nicely: corrigendum

Authors:
Thorsten Akkerman;Christoph Buchheim;Michael Jünger;Daniel Teske
Affiliations:
Universität zu Köln, Institut für Informatik, Pohligstrasse 1, 50969, Köln, Germany;Universität zu Köln, Institut für Informatik, Pohligstrasse 1, 50969, Köln, Germany;Universität zu Köln, Institut für Informatik, Pohligstrasse 1, 50969, Köln, Germany;Universität zu Köln, Institut für Informatik, Pohligstrasse 1, 50969, Köln, Germany
Venue:
Acta Informatica
Year:
2004

Citing 0
Cited 1

Drawing ordered (k - 1)-ary trees on k-grids

GD'10 Proceedings of the 18th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

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.