On Upward Drawings of Trees on a Given Grid

Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known for straight-line drawings of trees under various restrictions such as edge length or slope constraints. On the other hand, there exist polynomial-time algorithms for computing minimum-width (resp., minimum-height) upward drawings of trees, where the height (resp., width) is unbounded.

[1]  Wolfgang Brunner,et al.  Drawing Ordered (k - 1)-Ary Trees on k-Grids , 2010, GD.

[2]  Md. Saidur Rahman,et al.  Minimum-Layer Drawings of Trees Submitted , 2010 .

[3]  Therese C. Biedl.  On Area-Optimal Planar Graph Drawings , 2014, ICALP.

[4]  Christian Bachmaier,et al.  Drawing Unordered Trees on k-Grids , 2013, J. Graph Algorithms Appl..

[5]  Edward M. Reingold,et al.  The complexity of drawing trees nicely , 2004, Acta Informatica.

[6]  Angelo Gregori,et al.  Unit-Length Embedding of Binary Trees on a Square Grid , 1989, Inf. Process. Lett..

[7]  Dorothea Wagner,et al.  Minimizing the Area for Planar Straight-Line Grid Drawings , 2007, Graph Drawing.

[8]  Giuseppe Di Battista,et al.  A Survey on Small-Area Planar Graph Drawing , 2014, ArXiv.

[9]  Luca Trevisan.  A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees , 1996, Inf. Process. Lett..

[10]  Roberto Tamassia,et al.  Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications) , 2007 .

[11]  Peter J. Stuckey,et al.  NP-Completeness of Minimal Width Unordered Tree Layout , 2004, J. Graph Algorithms Appl..

[12]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

[13]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[14]  Therese C. Biedl.  Optimum-width upward drawings of trees I: Rooted pathwidth , 2015, ArXiv.

[15]  Md. Saidur Rahman,et al.  Minimum-Layer Upward Drawings of Trees , 2010, J. Graph Algorithms Appl..

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Debajyoti Mondal,et al.  Minimum-Area Drawings of Plane 3-Trees , 2010, J. Graph Algorithms Appl..