메뉴 건너뛰기




Volumn 6809, Issue , 2008, Pages

G-Space: A linear time graph layout

Author keywords

Graph drawing; Graph layout; Graph visualization; Graphs and networks; Information visualization

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DATA VISUALIZATION; FEATURE EXTRACTION; TWO DIMENSIONAL;

EID: 43249097842     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.768012     Document Type: Conference Paper
Times cited : (1)

References (13)
  • 3
    • 0026257928 scopus 로고
    • Graph drawing by force-directed placement
    • T. Fruchterman and E. Reingold. "Graph drawing by force-directed placement." Softw. Pract. Exp., 21(11): 1129-1164, 1991.
    • (1991) Softw. Pract. Exp , vol.21 , Issue.11 , pp. 1129-1164
    • Fruchterman, T.1    Reingold, E.2
  • 5
    • 84867475630 scopus 로고    scopus 로고
    • Graph drawing by high-dimensional embedding
    • Proc. Graph Drawing GD'02, of
    • Y. Koren and D. Harel. "Graph drawing by high-dimensional embedding." In Proc. Graph Drawing (GD'02), volume 2528 of LNCS, pages 207-219, 2002.
    • (2002) LNCS , vol.2528 , pp. 207-219
    • Koren, Y.1    Harel, D.2
  • 6
    • 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, 1(4):645-673, 2003.
    • (2003) Multiscale Modeling and Simulation , vol.1 , Issue.4 , pp. 645-673
    • Koren, Y.1    Carmel, L.2    Harel, D.3
  • 7
    • 24144445382 scopus 로고    scopus 로고
    • Drawing large graphs with a potential-field-based multilevel algorithm
    • Proc. 12th Int. Symp. on Graph Drawing, of, Springer-Verlag
    • S. Hachul and M. Jünger. "Drawing large graphs with a potential-field-based multilevel algorithm." In Proc. 12th Int. Symp. on Graph Drawing, volume 3383 of LNCS, pages 285-295. Springer-Verlag, 2004.
    • (2004) LNCS , vol.3383 , pp. 285-295
    • Hachul, S.1    Jünger, M.2
  • 9
    • 33845640864 scopus 로고    scopus 로고
    • Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
    • D. Holten. "Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data." IEEE Transactions on Visualization and Computer Graphics, 12(5):741-748, 2006.
    • (2006) IEEE Transactions on Visualization and Computer Graphics , vol.12 , Issue.5 , pp. 741-748
    • Holten, D.1
  • 10
    • 38149073795 scopus 로고    scopus 로고
    • An experimental comparison of fast algorithms for drawing general large graphs
    • Springer-Verlag
    • S. Hachul and M. Jünger. "An experimental comparison of fast algorithms for drawing general large graphs." In Proc. 13th Int. Symp. on Graph Drawing. Springer-Verlag, 2005.
    • (2005) Proc. 13th Int. Symp. on Graph Drawing
    • Hachul, S.1    Jünger, M.2
  • 11
    • 33745593949 scopus 로고    scopus 로고
    • Sparse multidimensional scaling using landmark points
    • Stanford University
    • V. de Silva, J. B. Tenenbaum. "Sparse multidimensional scaling using landmark points" (Technical Report). Stanford University.
    • Technical Report
    • de Silva, V.1    Tenenbaum, J.B.2
  • 12
    • 84997941468 scopus 로고    scopus 로고
    • Fast multidimensional scaling through sampling, springs and interpolation
    • March
    • A. Morrison, G. Ross, M. Chalmers. "Fast multidimensional scaling through sampling, springs and interpolation". Information Visualization 2(1) March 2003, pp. 68-77.
    • (2003) Information Visualization , vol.2 , Issue.1 , pp. 68-77
    • Morrison, A.1    Ross, G.2    Chalmers, M.3
  • 13
    • 85198671464 scopus 로고    scopus 로고
    • C. Faloutsos, K.-L Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of 1995 ACM SIGMOD, SIGMOD RECORD (June 1995), 24, no.2, p 163-174.
    • C. Faloutsos, K.-L Lin. FastMap: "A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets." In Proceedings of 1995 ACM SIGMOD, SIGMOD RECORD (June 1995), vol.24, no.2, p 163-174.


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