On the complexity of drawing trees nicely: Corrigendum

DOI10.1007/S00236-004-0138-YMaRDI QIDQ1889885zbMATH OpenOpenAlexFDO

Authors Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske

Publication date 13 December 2004

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL http://e-archive.informatik.uni-koeln.de/465/2/zaik2004-465.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• NP-Completeness of Minimal Width Unordered Tree Layout
• Unit-length embedding of binary trees on a square grid
• On upward drawings of trees on a given grid
• scientific article; zbMATH DE number 219263
• How to fit a tree in a box

Cited in

(4)

• NP-Completeness of Minimal Width Unordered Tree Layout
• Corrigendum to: `Complexity of diagrams'
• On the approximability of two tree drawing conventions
• Erratum to: ``Computationally tractable approximate and smoothed Polya trees

This page was built for publication: On the complexity of drawing trees nicely: Corrigendum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889885)