메뉴 건너뛰기




Volumn 112, Issue 11, 2012, Pages 418-422

Drawing trees in a streaming model

Author keywords

Design of algorithms; Graph algorithms; Graph drawing; Large graphs; Online algorithms; Streaming

Indexed keywords

DESIGN OF ALGORITHMS; GRAPH ALGORITHMS; GRAPH DRAWING; LARGE GRAPHS; ON-LINE ALGORITHMS;

EID: 84858733502     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2012.02.011     Document Type: Article
Times cited : (23)

References (20)
  • 5
    • 8844244248 scopus 로고    scopus 로고
    • Dynamic Graph Drawing
    • J. Branke Dynamic graph drawing M. Kaufmann, D. Wagner, Drawing Graphs: Methods and Models LNCS vol. 2025 2001 Springer 228 246 (Pubitemid 33267306)
    • (2001) Lecture Notes in Computer Science , Issue.2025 , pp. 228-246
    • Branke, J.1
  • 6
    • 0032337812 scopus 로고    scopus 로고
    • On-line animated visualization of huge graphs using a modified spring algorithm
    • M.L. Huang, P. Eades, and J. Wang On-line animated visualization of huge graphs using a modified spring algorithm J. Vis. Lang. Comput. 9 6 1998 623 645 (Pubitemid 128179507)
    • (1998) Journal of Visual Languages and Computing , vol.9 , Issue.6 , pp. 623-645
    • Huang, M.L.1    Eades, P.2    Wang, J.3
  • 8
    • 20744439022 scopus 로고    scopus 로고
    • Reductions in streaming algorithms, with an application to counting triangles in graphs
    • Z. Bar-Yossef, R. Kumar, D. Sivakumar, Reductions in streaming algorithms, with an application to counting triangles in graphs, in: Proc. SODA, 2002, pp. 623-632.
    • (2002) Proc. SODA , pp. 623-632
    • Bar-Yossef, Z.1    Kumar, R.2    Sivakumar, D.3
  • 11
    • 0036623749 scopus 로고    scopus 로고
    • Scalable visualizations of object-oriented systems with ownership trees
    • 10.1006/jvlc.2002.0238
    • T. Hill, J. Noble, and J. Potter Scalable visualizations of object-oriented systems with ownership trees J. Vis. Lang. Comput. 13 2002 319 339 10.1006/jvlc.2002.0238
    • (2002) J. Vis. Lang. Comput. , vol.13 , pp. 319-339
    • Hill, T.1    Noble, J.2    Potter, J.3
  • 14
    • 27744510480 scopus 로고    scopus 로고
    • Application of helix cone tree visualization to dynamic call graph illustration
    • J. Joshi, B. Cleary, C. Exton, Application of helix cone tree visualization to dynamic call graph illustration, in: Third Program Visualization Workshop, 2004, pp. 68-75.
    • (2004) Third Program Visualization Workshop , pp. 68-75
    • Joshi, J.1    Cleary, B.2    Exton, C.3
  • 16
    • 24344446829 scopus 로고    scopus 로고
    • Straight-line drawings of binary trees with linear area and arbitrary aspect ratio
    • A. Garg, and A. Rusu Straight-line drawings of binary trees with linear area and arbitrary aspect ratio J. Graph Algorithms Appl. 8 2 2004 135 160 (Pubitemid 41261230)
    • (2004) Journal of Graph Algorithms and Applications , vol.8 , Issue.2 , pp. 135-160
    • Garg, A.1    Rusu, A.2
  • 17
    • 1342319812 scopus 로고    scopus 로고
    • Straight-line drawings of general trees with linear area and arbitrary aspect ratio
    • ICCSA'03
    • A. Garg, and A. Rusu Straight-line drawings of general trees with linear area and arbitrary aspect ratio ICCSA'03 LNCS vol. 2669 2002 876 885
    • (2002) LNCS , vol.2669 , pp. 876-885
    • Garg, A.1    Rusu, A.2
  • 18
    • 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
  • 20
    • 3042717663 scopus 로고    scopus 로고
    • The minimum area of convex lattice n-gons
    • DOI 10.1007/s00493-004-0012-0
    • I. Bárány, and N. Tokushige The minimum area of convex lattice n-gons Combinatorica 24 2 2004 171 185 (Pubitemid 38883397)
    • (2004) Combinatorica , vol.24 , Issue.2 , pp. 171-185
    • Barany, I.1    Tokushige, N.2


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