메뉴 건너뛰기




Volumn 18, Issue 5, 2012, Pages 797-809

A space-filling visualization technique for multivariate small-world graphs

Author keywords

Data and knowledge visualization; information visualization; visualization techniques and methodologies

Indexed keywords

DESIGN APPROACHES; DOMAIN EXPERTS; ELECTRIC POWER GRIDS; FIEDLER VECTORS; FRACTAL CURVES; GRAPH LAPLACIAN; INFORMATION VISUALIZATION; KNOWLEDGE VISUALIZATION; NEIGHBORING NODES; POWER GRIDS; RESEARCH AND DEVELOPMENT; ROBUST ALGORITHM; SMALL WORLDS; SMALL-WORLD GRAPHS; SPACE-FILLING; SPARSE GRAPHS; SPATIAL CUES; USABILITY STUDIES; VISUALIZATION TECHNIQUE; VISUALIZATION TECHNIQUES AND METHODOLOGIES;

EID: 84863395267     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2011.99     Document Type: Article
Times cited : (15)

References (39)
  • 1
    • 0028419680 scopus 로고
    • A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
    • Apr
    • S.T. Barnard and H.D. Simon, "A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems," Concurrency: Practice and Experience, vol. 6, no. 2, pp. 101-117, Apr. 1994.
    • (1994) Concurrency: Practice and Experience , vol.6 , Issue.2 , pp. 101-117
    • Barnard, S.T.1    Simon, H.D.2
  • 9
    • 0042566833 scopus 로고
    • Laplacian of graphs and algebraic connectivity
    • M. Fiedler, "Laplacian of Graphs and Algebraic Connectivity," Combinatorics and Graph Theory, vol. 25, pp. 57-70, 1989.
    • (1989) Combinatorics and Graph Theory , vol.25 , pp. 57-70
    • Fiedler, M.1
  • 10
    • 84944811700 scopus 로고
    • The use of ranks to avoid the assumption of normality implicit in the analysis of variance
    • M. Friedman, "The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance," J. Am. Statistical Assoc., vol. 32, no. 200, pp. 675-701, 1937.
    • (1937) J. Am. Statistical Assoc. , vol.32 , Issue.200 , pp. 675-701
    • Friedman, M.1
  • 13
    • 84863397378 scopus 로고    scopus 로고
    • GD96 Graph Drawing Contest, http://vlado.fmf.uni-lj.si/pub/networks/data/ gd/gd96/B96.gph, 2011.
    • (2011) GD96 Graph Drawing Contest
  • 14
    • 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, 2003.
    • (2003) J. Graph Algorithms and Applications , vol.6 , Issue.3 , pp. 179-202
    • Harel, D.1    Koren, Y.2
  • 15
    • 0033872934 scopus 로고    scopus 로고
    • Graph visualization and navigation in information visualization: A survey
    • DOI 10.1109/2945.841119
    • Herman, G. Melancon, and M.S. Marshall, "Graph Visualization and Navigation in Information Visualization: A Survey," IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 1, pp. 24-43, Jan.-Mar. 2000. (Pubitemid 30594718)
    • (2000) IEEE Transactions on Visualization and Computer Graphics , vol.6 , Issue.1 , pp. 24-43
    • Herman, I.1    Melancon, G.2    Marshall, M.S.3
  • 17
    • 84863420504 scopus 로고    scopus 로고
    • IEEE Conf. Information Visualization
    • IEEE InfoVis 2011, IEEE Conf. Information Visualization, http://www.visweek.org/visweek/2011/info/infovis-welcome/infoviswelcome, 2011.
    • (2011) IEEE InfoVis 2011
  • 19
    • 84863418049 scopus 로고    scopus 로고
    • LAPACK, http://www.netlib.org/lapack, 2011.
    • (2011) LAPACK
  • 20
    • 84863420503 scopus 로고    scopus 로고
    • A highly efficient parallel algorithm for computing the fiedler vector
    • M. Manguoglu, "A Highly Efficient Parallel Algorithm for Computing the Fiedler Vector," CoRR abs/1008.1700, 2010.
    • (2010) CoRR abs/1008.1700
    • Manguoglu, M.1
  • 21
    • 0002687371 scopus 로고
    • The small-world problem
    • S. Milgram, "The Small-World Problem," Psychology Today, vol. 2, pp. 60-67, 1967.
    • (1967) Psychology Today , vol.2 , pp. 60-67
    • Milgram, S.1
  • 22
    • 54949092423 scopus 로고    scopus 로고
    • Rapid graph layout using space filling curves
    • Nov./Dec
    • C. Muelder and K.-L. Ma, "Rapid Graph Layout Using Space Filling Curves," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 1301-1308, Nov./Dec. 2008.
    • (2008) IEEE Trans. Visualization and Computer Graphics , vol.14 , Issue.6 , pp. 1301-1308
    • Muelder, C.1    Ma, K.-L.2
  • 24
    • 0016555955 scopus 로고
    • Solution of sparse indefinite systems of linear equations
    • C.C. Paige and M.A. Saunders, "Solution of Sparse Indefinite Systems of Linear Equations," SIAM J. Numerical Analysis, vol. 12, no. 4, pp. 617-629, 1975.
    • (1975) SIAM J. Numerical Analysis , vol.12 , Issue.4 , pp. 617-629
    • Paige, C.C.1    Saunders, M.A.2
  • 29
    • 0002706353 scopus 로고
    • Space-filling curves and a measure of coherence
    • Academic Press
    • D. Voorhies, "Space-Filling Curves and A Measure of Coherence," Graphics Gems, pp. 26-30, Academic Press, 1991.
    • (1991) Graphics Gems , pp. 26-30
    • Voorhies, D.1
  • 30
    • 4043141349 scopus 로고    scopus 로고
    • A multilevel algorithm for forced-directed graph-drawing
    • C. Walshaw, "A Multilevel Algorithm for Forced-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
  • 34
    • 0001884644 scopus 로고
    • Individual comparisons by ranking methods
    • Dec
    • F. Wilcoxon, "Individual Comparisons by Ranking Methods," Biometrics Bull., vol. 1, no. 6, pp. 80-83, Dec. 1945.
    • (1945) Biometrics Bull. , vol.1 , Issue.6 , pp. 80-83
    • Wilcoxon, F.1


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