On the complexity of drawing trees nicely: corrigendum

Akkerman, Thorsten and Buchheim, Christoph and Jünger, Michael and Teske, Daniel (2004) On the complexity of drawing trees nicely: corrigendum. [Journal (Paginated)]

Full text not available from this repository.


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 aesthetic requirements are obeyed. We identify and repair a mistake in their proof.

Item Type: Journal (Paginated)
Additional Information: 10.1007/s00236-004-0138-y
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
URI: http://gdea.informatik.uni-koeln.de/id/eprint/623

Actions (login required)

View Item View Item