메뉴 건너뛰기




Volumn 63, Issue 6, 1997, Pages 303-307

Logarithmic width, linear area upward drawing of AVL trees

Author keywords

Algorithms; Binary tree; Graph drawing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

EID: 0031219886     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00137-3     Document Type: Article
Times cited : (4)

References (3)
  • 2
    • 38149048215 scopus 로고
    • A note on optimal area algorithms for upward drawings of binary trees
    • P. Crescenzi, G. Di Battista and A. Piperno, A note on optimal area algorithms for upward drawings of binary trees, Comput. Geom. Theory Appl. 2 (1992) 187-200.
    • (1992) Comput. Geom. Theory Appl. , vol.2 , pp. 187-200
    • Crescenzi, P.1    Di Battista, G.2    Piperno, A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.