Strictly-upward drawings of ordered search trees

Theoretical Computer Science

Volumn 203, Issue 1, 1998, Pages 51-67

  Crescenzi, P ^a   Penna, P ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Area requirement; Graph drawing; Upward drawing

Indexed keywords

EID: 0141947756     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00287-9     Document Type: Article

References (13)

1. T. Chan, M.T. Goodrich, S.R. Kosaraju, R. Tamassia, Optimizing area and aspect ratio in straight-line orthogonal tree drawings, in: Proc. Graph Drawing, 1996, pp. 63-75.
2. C.-S. Shin, S.K. Kim, K.-Y. Chwa, Area-efficient algorithms for upward straight-line drawings, in: Proc. COCOON '96, to appear.
3. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1990.
4. P. Crescenzi, G. Di Battista, A. Piperno, A note on optimal area algorithms for upward drawings of binary trees, Comput. Geometry: Theory Appl. 2 (1992) 187-200.
5. P. Crescenzi, P. Penna, A. Piperno, Linear area upward drawings of AVL trees, Comput. Geometry: Theory Appl., to appear.
6. P. Crescenzi, A. Piperno. Optimal-area upward drawings of AVL trees, in: Proc. Graph Drawing, 1994, pp. 307-317.
7. G. Di Battista, P. Eades, R. Tamassia, I. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Geometry: Theory Appl. 4 (1994) 235-282.
8. P. Eades, T. Lin, X. Lin. Minimum size h-v drawings, in: Proc. Internat. Workshop AVI '92, 1992, pp. 386-394.
9. A. Garg, M.T. Goodrich, R. Tamassia, Area-efficient upward tree drawing, in: Proc. ACM Symp. on Computational Geometry, 1993, pp. 359-368.
10. A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, in: Proc. Graph Drawing, 1994, pp. 286-297.
11. D.E. Knuth, The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA, 1975.
12. Y. Shiloach, Linear and planar arrangements of graphs, Ph.D. Thesis, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, 1976.
13. L. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Comput. C-30 (2) (1981) 135-140.