On the complexity of drawing trees nicely: Corrigendum
From MaRDI portal
Publication:1889885
DOI10.1007/s00236-004-0138-yzbMath1098.68051OpenAlexW2034416883MaRDI QIDQ1889885
Daniel Teske, Christoph Buchheim, Michael Jünger, Thorsten Akkerman
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
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
