On the complexity of drawing trees nicely: corrigendum

Author： Akkerman Thorsten Buchheim Christoph Jünger Michael Teske Daniel

ISSN： 0001-5903

Source： Acta Informatica, Vol.40, Iss.8, 2004-07, pp. : 603-607

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On the Parameterized Complexity of Layered Graph Drawing

By Dujmović Vida Fellows Michael Kitching Matthew Liotta Giuseppe McCartin Catherine Nishimura Naomi Ragde Prabhakar Rosamond Frances Whitesides Sue Wood David

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 267-292

Springer Publishing Company

Access to resources Recommend Favorite

The complexity of subgraph isomorphism for classes of partial k-trees

By Gupta A. Nishimura N.

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 287-298

Elsevier

Access to resources Recommend Favorite

Entropy Quad-Trees for High Complexity Regions Detection

International Journal of Software Science and Computational Intelligence (IJSSCI), Vol. 3, Iss. 1, 2011-01 ,pp. : 16-33

IGI Global_journal

Access to resources Recommend Favorite

Complexity lower bounds for computation trees with elementary transcendental function gates

By Grigoriev D. Vorobjov N.

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 185-214

Elsevier

Access to resources Recommend Favorite

Corrigendum

Journal of Computer-Aided Molecular Design, Vol. 17, Iss. 10, 2003-10 ,pp. : 711-711

Springer Publishing Company

Access to resources Recommend Favorite