메뉴 건너뛰기




Volumn 1984, Issue , 2001, Pages 360-371

An algorithm for finding three dimensional symmetry in Trees

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; DRAWING (GRAPHICS); FORESTRY; TREES (MATHEMATICS);

EID: 84958544542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_34     Document Type: Conference Paper
Times cited : (8)

References (11)
  • 5
    • 84957870514 scopus 로고    scopus 로고
    • Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
    • S. Whitesides, editor, Lecture Notes in Computer Science, Springer Verlag
    • S. Hong, P. Eades, A. Quigley and S. Lee, Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions, In S. Whitesides, editor, Graph Drawing (Proc. GD'98), vol. 1547 of Lecture Notes in Computer Science, pp. 198-209, Springer Verlag, 1998.
    • (1998) Graph Drawing (Proc. GD'98) , vol.1547 , pp. 198-209
    • Hong, S.1    Eades, P.2    Quigley, A.3    Lee, S.4
  • 8
    • 0342825403 scopus 로고
    • Fast Detection and Display of Symmetry in Trees
    • J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Trees, Congressus Numerantium, 64, pp. 159-169, 1988.
    • (1988) Congressus Numerantium , vol.64 , pp. 159-169
    • Manning, J.1    Atallah, M.J.2
  • 9
    • 38249009134 scopus 로고
    • Fast Detection and Display of Symmetry in Outerplanar Graphs
    • J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Outerplanar Graphs, Discrete Applied Mathematics, 39, pp. 13-35, 1992.
    • (1992) Discrete Applied Mathematics , vol.39 , pp. 13-35
    • Manning, J.1    Atallah, M.J.2


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