Akkerman, Thorsten, Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Teske, Daniel (2004). On the Complexity of Drawing Trees Nicely: Corrigendum. Acta Informatica, 40 (8). pp. 603-607. Springer.

[thumbnail of zaik2004-465.pdf]
Preview
 PDF
zaik2004-465.pdf - Draft Version
Download (111kB) | Preview

Abstract

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: Article
Creators:
Creators
Email
ORCID
ORCID Put Code
Akkerman, Thorsten
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Buchheim, Christoph
UNSPECIFIED
https://orcid.org/0000-0001-9974-404X
UNSPECIFIED
Jünger, Michael
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Teske, Daniel
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-548751
Journal or Publication Title: Acta Informatica
Volume: 40
Number: 8
Page Range: pp. 603-607
Date: 2004
Publisher: Springer
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54875

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item