Strictly-upward Drawings of Ordered Search Trees
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.
[2] Tao Lin,et al. Minimum Size h-v Drawings , 1992, Advanced Visual Interfaces.
[3] Timothy M. Chan,et al. Optimizing area and aspect ration in straight-line orthogonal tree drawings , 1996, Comput. Geom..
[4] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[5] Giuseppe Di Battista,et al. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..
[6] Paolo Penna,et al. Linear area upward drawings of AVL trees , 1998, Comput. Geom..
[7] Roberto Tamassia,et al. On the Compuational Complexity of Upward and Rectilinear Planarity Testing , 1994, Graph Drawing.
[8] Michael T. Goodrich,et al. Area-efficient upward tree drawings , 1993, SCG '93.
[9] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[10] Kyung-Yong Chwa,et al. Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract) , 1996, COCOON.
[11] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..
[12] Pierluigi Crescenzi,et al. Optimal-Area Upward Drawings of AVL Trees , 1994, Graph Drawing.