메뉴 건너뛰기




Volumn 14, Issue 4, 2008, Pages 727-740

Online dynamic graph drawing

Author keywords

GPU; Graph layout

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS); DYNAMIC PROGRAMMING; INTERNET; USER INTERFACES;

EID: 44649087050     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2008.11     Document Type: Conference Paper
Times cited : (142)

References (38)
  • 3
    • 84867485251 scopus 로고    scopus 로고
    • S. Diehl and C. Gorg, Graphs, They Are Changing - Dynamic Graph Drawing for a Sequence of Graphs, LNCS 2528, pp. 23-31, 2002.
    • S. Diehl and C. Gorg, Graphs, "They Are Changing - Dynamic Graph Drawing for a Sequence of Graphs," LNCS 2528, pp. 23-31, 2002.
  • 11
    • 33745668441 scopus 로고    scopus 로고
    • An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs
    • S. Hachul and M. Jünger, "An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs," Proc. 13th Int'l Symp. Graph Drawing (GD '05), pp. 235-250, 2005.
    • (2005) Proc. 13th Int'l Symp. Graph Drawing (GD '05) , pp. 235-250
    • Hachul, S.1    Jünger, M.2
  • 12
    • 4043141349 scopus 로고    scopus 로고
    • A Multilevel Algorithm for Force-Directed Graph Drawing
    • C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing," J. Graph Algorithms and Applications, vol. 7, no. 3, pp. 253-285, 2003.
    • (2003) J. Graph Algorithms and Applications , vol.7 , Issue.3 , pp. 253-285
    • Walshaw, C.1
  • 13
    • 4043171150 scopus 로고    scopus 로고
    • A Fast Multi-Scale Algorithm for Drawing Large Graphs
    • D. Harel and Y. Koren, "A Fast Multi-Scale Algorithm for Drawing Large Graphs," J. Graph Algorithms and Applications, vol. 6, no. 3, pp. 179-202, 2002.
    • (2002) J. Graph Algorithms and Applications , vol.6 , Issue.3 , pp. 179-202
    • Harel, D.1    Koren, Y.2
  • 15
    • 3242722008 scopus 로고    scopus 로고
    • A Multi-Dimensional Approach to Force-Directed Layouts of Large Graphs
    • P. Gajer, M.T. Goodrich, and S.G. Kobourov, "A Multi-Dimensional Approach to Force-Directed Layouts of Large Graphs," Computational Geometry, vol. 29, no. 1, pp. 3-18, 2004.
    • (2004) Computational Geometry , vol.29 , Issue.1 , pp. 3-18
    • Gajer, P.1    Goodrich, M.T.2    Kobourov, S.G.3
  • 16
    • 24144445382 scopus 로고    scopus 로고
    • Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm
    • S. Hachul and M. Jünger, "Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm," Proc. 12th Int'l Symp. Graph Drawing (GD '04), pp. 285-295, 2004.
    • (2004) Proc. 12th Int'l Symp. Graph Drawing (GD '04) , pp. 285-295
    • Hachul, S.1    Jünger, M.2
  • 17
    • 85014929888 scopus 로고    scopus 로고
    • Drawing Huge Graphs by Algebraic Multigrid Optimization
    • Y. Koren, L. Carmel, and D. Harel, "Drawing Huge Graphs by Algebraic Multigrid Optimization," Multiscale Modeling and Simulation, vol. 1, no. 4, pp. 645-673, 2003.
    • (2003) Multiscale Modeling and Simulation , vol.1 , Issue.4 , pp. 645-673
    • Koren, Y.1    Carmel, L.2    Harel, D.3
  • 18
    • 24344442752 scopus 로고    scopus 로고
    • Graph Drawing by High-Dimensional Embedding
    • D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embedding," J. Graph Algorithms and Applications, vol. 8, no. 2, pp. 195-214, 2004.
    • (2004) J. Graph Algorithms and Applications , vol.8 , Issue.2 , pp. 195-214
    • Harel, D.1    Koren, Y.2
  • 21
    • 21344440509 scopus 로고    scopus 로고
    • J. Moody, D. McFarland, and S. Bender-deMoll, Dynamic Network Visualization, Am. J. Sociology, 110, no. 4, pp. 1206-1241, http://www.journals.uchicago.edu/AJS/journal/issues/ v110n4/080349/080349.html, 2005.
    • J. Moody, D. McFarland, and S. Bender-deMoll, "Dynamic Network Visualization," Am. J. Sociology, vol. 110, no. 4, pp. 1206-1241, http://www.journals.uchicago.edu/AJS/journal/issues/ v110n4/080349/080349.html, 2005.
  • 25
    • 25844449062 scopus 로고    scopus 로고
    • Large Steps in GPU-Based Deformable Bodies Simulation
    • E. Tejada and T. Ertl, "Large Steps in GPU-Based Deformable Bodies Simulation," Simulation Modelling Practice and Theory, vol. 13, pp. 703-715, 2005.
    • (2005) Simulation Modelling Practice and Theory , vol.13 , pp. 703-715
    • Tejada, E.1    Ertl, T.2
  • 28
    • 44649108103 scopus 로고    scopus 로고
    • Glimmer: Multilevel MDS on the GPU,
    • TR-2007-15, Univ. of British Columbia
    • I. Stephen, T. Munzner, and M. Olano, "Glimmer: Multilevel MDS on the GPU," Technical Report UBC CS TR-2007-15, Univ. of British Columbia, 2007.
    • (2007) Technical Report UBC CS
    • Stephen, I.1    Munzner, T.2    Olano, M.3
  • 33
    • 0009428249 scopus 로고    scopus 로고
    • Drawing Graphs to Convey Proximity: An Incremental Arrangement Method
    • J.D. Cohen, "Drawing Graphs to Convey Proximity: An Incremental Arrangement Method," ACM Trans. Computer-Human Interaction, vol. 4, no. 3, pp. 197-229, 1997.
    • (1997) ACM Trans. Computer-Human Interaction , vol.4 , Issue.3 , pp. 197-229
    • Cohen, J.D.1
  • 34
    • 0024640140 scopus 로고
    • An Algorithm for Drawing General Undirected Graphs
    • T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs," Information Processing Letters, vol. 31, no. 1, pp. 7-15, 1989.
    • (1989) Information Processing Letters , vol.31 , Issue.1 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 37
    • 84884150847 scopus 로고    scopus 로고
    • The Art and Science of Dynamic Network Visualization
    • S. Bender-deMoll and D. McFarland, "The Art and Science of Dynamic Network Visualization," J. Social Structure, vol. 7, no. 2, 2006.
    • (2006) J. Social Structure , vol.7 , Issue.2
    • Bender-deMoll, S.1    McFarland, D.2
  • 38


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