메뉴 건너뛰기




Volumn 17, Issue 11, 2011, Pages 1587-1598

Visual analysis of large graphs using (X,Y)-clustering and hybrid visualizations

Author keywords

graph clustering; hybrid visualization; Large graphs; Visual analytics

Indexed keywords

CLUSTERING TECHNIQUES; GRAPH CLUSTERING; HYBRID VISUALIZATION; INTRA-CLUSTER; LARGE GRAPHS; LARGE NETWORKS; MENTAL MAPS; PROOF OF CONCEPT; SOCIAL NETWORKS; TOPOLOGICAL PROPERTIES; VISUAL ANALYSIS; VISUAL ANALYTICS; VISUALIZATION TOOLS;

EID: 80052610417     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2010.265     Document Type: Article
Times cited : (69)

References (56)
  • 1
    • 24144448986 scopus 로고    scopus 로고
    • Visualizing large graphs with compound-fisheye views and treemaps
    • Graph Drwing - 12th International Symposium, GD 2004
    • J. Abello, S. Kobourov, and R. Yusufov, "Visualizing Large Graphs with Compound-Fisheye Views and Treemaps," Proc. Graph Drawing (GD '04), pp. 431-441, 2004. (Pubitemid 41239586)
    • (2004) Lecture Notes in Computer Science , vol.3383 , pp. 431-441
    • Abello, J.1    Kobourov, S.G.2    Yusufov, R.3
  • 3
    • 44649090431 scopus 로고    scopus 로고
    • Grouse: Feature-based, steerable graph hierarchy exploration
    • D. Archambault, T. Munzner, and D. Auber, "Grouse: Feature-Based, Steerable Graph Hierarchy Exploration," Proc. Eurographics, pp. 67-74, 2007.
    • (2007) Proc. Eurographics , pp. 67-74
    • Archambault, D.1    Munzner, T.2    Auber, D.3
  • 5
    • 44649096952 scopus 로고    scopus 로고
    • GrouseFlocks: Steerable exploration of graph hierarchy space
    • DOI 10.1109/TVCG.2008.34, 4447668
    • D. Archambault, T. Munzner, and D. Auber, "Grouseflocks: Steerable Exploration of Graph Hierarchy Space," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 4, pp. 900-913, July/Aug. 2008. (Pubitemid 351780215)
    • (2008) IEEE Transactions on Visualization and Computer Graphics , vol.14 , Issue.4 , pp. 900-913
    • Archambault, D.1    Munzner, T.2    Auber, D.3
  • 9
    • 56849098124 scopus 로고    scopus 로고
    • An O(m) algorithm for cores decomposition of networks
    • V. Batagelj and M. Zaversnik, "An O(m) Algorithm for Cores Decomposition of Networks," CoRR, cs.DS/0310049, 2003.
    • (2003) CoRR, cs.DS/0310049
    • Batagelj, V.1    Zaversnik, M.2
  • 11
    • 84958969766 scopus 로고    scopus 로고
    • A force-directed algorithm that preserves edge crossing properties
    • F. Bertault, "A Force-Directed Algorithm that Preserves Edge Crossing Properties," Proc. Graph Drawing, pp. 351-358, 1999.
    • (1999) Proc. Graph Drawing , pp. 351-358
    • Bertault, F.1
  • 12
    • 0011632190 scopus 로고
    • The evolution of sparse graphs
    • Academic Press
    • B. Bollobas, "The Evolution of Sparse Graphs," Graph Theory and Combinatorics, pp. 35-57, Academic Press, 1984.
    • (1984) Graph Theory and Combinatorics , pp. 35-57
    • Bollobas, B.1
  • 16
    • 33749059961 scopus 로고    scopus 로고
    • Beyond guidelines: What can we learn from the visual information seeking mantra?
    • DOI 10.1109/IV.2005.28, 1509067, Proceedings - Ninth International Conference on Information Visualisation, iV05
    • B. Craft and P. Cairns, "Beyond Guidelines: What Can We Learn from the Visual Information Seeking Mantra?," Proc. IEEE Ninth Int'l Conf. Information Visualization, pp. 110-118, 2005. (Pubitemid 44458502)
    • (2005) Proceedings of the International Conference on Information Visualisation , vol.2005 , pp. 110-118
    • Craft, B.1    Cairns, P.2
  • 23
    • 54949096676 scopus 로고    scopus 로고
    • Topology preserving constrained graph layout
    • T. Dwyer, K. Marriott, and M. Wybrow, "Topology Preserving Constrained Graph Layout," Proc. Graph Drawing, pp. 230-241, 2008.
    • (2008) Proc. Graph Drawing , pp. 230-241
    • Dwyer, T.1    Marriott, K.2    Wybrow, M.3
  • 24
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • P. Eades, "A Heuristic for Graph Drawing," Proc. Congressus Numerantium, vol. 42, pp. 149-160, 1984.
    • (1984) Proc. Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 25
    • 84957363650 scopus 로고    scopus 로고
    • Online Animated Graph Drawing for Web Navigation
    • Graph Drawing
    • P. Eades, R.F. Cohen, and M.L. Huang, "Online Animated Graph Drawing for Web Navigation," Proc. Fifth Int'l Symp. Graph Drawing (GD '97), pp. 330-335, 1997. (Pubitemid 128012920)
    • (1997) Lecture Notes in Computer Science , Issue.1353 , pp. 330-335
    • Eades, P.1    Cohen, R.F.2    Mao Lin Huang3
  • 26
    • 0006767318 scopus 로고    scopus 로고
    • Navigating clustered graphs using force-directed methods
    • P. Eades and M.L. Huang, "Navigating Clustered Graphs Using Force-Directed Methods," J. Graph Algorithms and Applications, vol. 4, no. 3, pp. 157-181, 2000. (Pubitemid 39064648)
    • (2000) Journal of Graph Algorithms and Applications , vol.4 , Issue.3 , pp. 157-181
    • Eades, P.1    Huang, M.L.2
  • 27
    • 24144435951 scopus 로고    scopus 로고
    • An efficient implementation of sugiyama's algorithm for layered graph drawing
    • M. Eiglsperger, M. Siebenhaller, and M. Kaufmann, "An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing," Proc. Graph Drawing (GD '05), pp. 155-166, 2005.
    • (2005) Proc. Graph Drawing (GD '05) , pp. 155-166
    • Eiglsperger, M.1    Siebenhaller, M.2    Kaufmann, M.3
  • 30
    • 84993767900 scopus 로고    scopus 로고
    • On the readability of graphs using node-link and matrix-based representations: A controlled experiment and statistical analysis
    • M. Ghoniem, J.-D. Fekete, and P. Castagliola, "On the Readability of Graphs Using Node-Link and Matrix-Based Representations: A Controlled Experiment and Statistical Analysis," Information Visualization, vol. 4, no. 2, pp. 114-135, 2005.
    • (2005) Information Visualization , vol.4 , Issue.2 , pp. 114-135
    • Ghoniem, M.1    Fekete, J.-D.2    Castagliola, P.3
  • 31
    • 79955688885 scopus 로고    scopus 로고
    • K-Core (Bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
    • A.V. Goltsev, S.N. Dorogovtsev, and J.F.F. Mendes, "k-Core (Bootstrap) Percolation on Complex Networks: Critical Phenomena and Nonlocal Effects," CoRR, abs/cond-mat/0602611, 2006.
    • (2006) CoRR, abs/cond-mat/0602611
    • Goltsev, A.V.1    Dorogovtsev, S.N.2    Mendes, J.F.F.3
  • 32
    • 60949105787 scopus 로고    scopus 로고
    • Large-Graph Layout Algorithms at Work: An Experimental Study
    • S. Hachul and M. Jü nger, "Large-Graph Layout Algorithms at Work: An Experimental Study," J. Graph Algorithms and Applications, vol. 11, no. 2, pp. 345-369, 2007.
    • (2007) J. Graph Algorithms and Applications , vol.11 , Issue.2 , pp. 345-369
    • Hachul, S.1    Jü Nger, M.2
  • 34
    • 0033872934 scopus 로고    scopus 로고
    • Graph visualization and navigation in information visualization: A survey
    • DOI 10.1109/2945.841119
    • I. Herman, G. Melançon, 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
  • 36
    • 80052634463 scopus 로고    scopus 로고
    • Drawing Graphs, M. Kaufmann and D. Wagner, eds. Springer Verlag, 2001
    • Drawing Graphs, M. Kaufmann and D. Wagner, eds. Springer Verlag, 2001.
  • 37
    • 0002838419 scopus 로고
    • String graphs ii-recognizing string graphs is np-hard
    • J. Kratochvý́l, "String Graphs II-Recognizing String Graphs Is NP-Hard," J. Combinatorial Theory, Series B, vol. 52, no. 1, pp. 67-78, 1991.
    • (1991) J. Combinatorial Theory, Series B , vol.52 , Issue.1 , pp. 67-78
    • Kratochvý́l, J.1
  • 38
    • 0030096204 scopus 로고    scopus 로고
    • The hyperbolic browser: A focus + context technique for visualizing large hierarchies
    • DOI 10.1006/jvlc.1996.0003
    • J. Lamping and R. Rao, "The Hyperbolic Browser: A Focus + Context Technique for Visualizing Large Hierarchies," J. Visual Languages and Computing, vol. 7, no. 1, pp. 33-55, 1996. (Pubitemid 126171007)
    • (1996) Journal of Visual Languages and Computing , vol.7 , Issue.1 , pp. 33-55
    • Lamping, J.1    Rao, R.2
  • 39
    • 0041861270 scopus 로고    scopus 로고
    • Splitting a graph into disjoint induced paths or cycles
    • H. Le, V. Le, and H. Mü ller, "Splitting a Graph into Disjoint Induced Paths or Cycles," Discrete Applied Math., vol. 131, pp. 199-212, 2003.
    • (2003) Discrete Applied Math. , vol.131 , pp. 199-212
    • Le, H.1    Le, V.2    Mü Ller, H.3
  • 41
    • 0002794707 scopus 로고
    • Planar formulae and their uses
    • D. Lichtenstein, "Planar Formulae and Their Uses," SIAM J. Computing, vol. 11, pp. 185-225, 1982.
    • (1982) SIAM J. Computing , vol.11 , pp. 185-225
    • Lichtenstein, D.1
  • 42
    • 0011572855 scopus 로고
    • Size and connectivity of the k-core of a random graph
    • T. Luczak, "Size and Connectivity of the K-Core of a Random Graph," Discrete Math., vol. 91, no. 1, pp. 61-68, 1991.
    • (1991) Discrete Math , vol.91 , Issue.1 , pp. 61-68
    • Luczak, T.1
  • 45
    • 84957362320 scopus 로고    scopus 로고
    • Which aesthetic has the greatest effect on human understanding?
    • H.C. Purchase, "Which Aesthetic Has the Greatest Effect on Human Understanding?," Proc. Graph Drawing (GD '97), pp. 248-261, 1998.
    • (1998) Proc. Graph Drawing (GD '97) , pp. 248-261
    • Purchase, H.C.1
  • 46
    • 0036723318 scopus 로고    scopus 로고
    • Empirical evaluation of aesthetics-based graph layout
    • DOI 10.1023/A:1016344215610
    • H.C. Purchase, D.A. Carrington, and J.-A. Allder, "Empirical Evaluation of Aesthetics-Based Graph Layout," Empirical Software Eng., vol. 7, no. 3, pp. 233-255, 2002. (Pubitemid 34950312)
    • (2002) Empirical Software Engineering , vol.7 , Issue.3 , pp. 233-255
    • Purchase, H.C.1    Carrington, D.2    Allder, J.-A.3
  • 49
    • 0000488788 scopus 로고
    • Network structure and minimum degree
    • S.B. Seidman, "Network Structure and Minimum Degree," Social Networks, vol. 5, pp. 269-287, 1983.
    • (1983) Social Networks , vol.5 , pp. 269-287
    • Seidman, S.B.1
  • 51
    • 0029725135 scopus 로고    scopus 로고
    • The eyes have it: A task by data type taxonomy for information visualizations
    • B. Shneiderman, "The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations," Proc. Visual Languages Conf, pp. 336-343, 1996.
    • (1996) Proc. Visual Languages Conf , pp. 336-343
    • Shneiderman, B.1
  • 53
    • 0023366861 scopus 로고
    • On embedding a graph in the grid with the minimum number of bends
    • R. Tamassia, "On Embedding a Graph in the Grid with the Minimum Number of Bends," SIAM J. Computing, vol. 16, no. 3, pp. 421-444, 1987. (Pubitemid 17583644)
    • (1987) SIAM Journal on Computing , vol.16 , Issue.3 , pp. 421-444
    • Tamassia Roberto1
  • 55
    • 13844310836 scopus 로고    scopus 로고
    • Peeling the yeast protein network
    • DOI 10.1002/pmic.200400962
    • S. Wuchty and E. Almaas, "Peeling the Yeast Protein Network," Proteomics, vol. 5, no. 2, pp. 444-449, 2005. (Pubitemid 40262062)
    • (2005) Proteomics , vol.5 , Issue.2 , pp. 444-449
    • Wuchty, S.1    Almaas, E.2
  • 56


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