Tidier Drawings of Trees

IEEE Transactions on Software Engineering

Volumn SE-7, Issue 2, 1981, Pages 223-228

  Reingold, Edward M ^a   Tilford, John S ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Data structures; tree structures; trees

Indexed keywords

MATHEMATICAL TECHNIQUES - TREES;

DATA PROCESSING;

EID: 0019543791     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1981.234519     Document Type: Article

References (6)

1. D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental mental Algorithms, 2nd ed. Reading, MA: Addison-Wesley, 1972.
2. K. J. Supowit and E. M. Reingold, “The complexity of drawing trees nicely,” to be published.
3. R. E. Sweet, “Empirical estimates of program entropy,” Dep. Comput. Sci., Stanford Univ., Stanford, CA, Rep. STAN-CS-78-698, 698, Nov. 1978; also issued as Rep. CSL-78-3, Xerox PARC, Palo Alto, CA, Sept. 1978.
4. J. S. Tilford, “Tree drawing algorithms,” M.S. thesis, Dep. Comput. Sci., Univ. Illinois, Urbana, IL, Rep. UIUC DCS-R-81-1055, 1981.
5. J. G. Vaucher, “Pretty-Printing of Trees,” Software-Practice and Experience, vol. 10, p. 553–561, 1980.
6. C. Wetherell and A. Shannon, “Tidy drawimgs of trees,” IEEE Trans. Software Eng., vol. SE-5, pp. 514–520, 1979.