메뉴 건너뛰기




Volumn 4875 LNCS, Issue , 2008, Pages 352-364

LunarVis - Analytic visualizations of large graphs

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; DRAWING (GRAPHICS); VISUALIZATION;

EID: 49949101964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77537-9_35     Document Type: Conference Paper
Times cited : (6)

References (21)
  • 2
    • 0036346132 scopus 로고    scopus 로고
    • The origin of power laws in internet topologies revisited
    • IEEE, Los Alamitos
    • Chen, Q., Chang, H., Govindan, R., Jamin, S.: The origin of power laws in internet topologies revisited. In: Proceedings of INFOCOM 2002, vol. 2, pp. 608-617. IEEE, Los Alamitos (2002)
    • (2002) Proceedings of INFOCOM , vol.2 , pp. 608-617
    • Chen, Q.1    Chang, H.2    Govindan, R.3    Jamin, S.4
  • 3
    • 13844310836 scopus 로고    scopus 로고
    • Peeling the yeast protein network
    • Wuchty, S., Almaas, E.: Peeling the yeast protein network. Proteomics 5(2), 444-449 (2005)
    • (2005) Proteomics , vol.5 , Issue.2 , pp. 444-449
    • Wuchty, S.1    Almaas, E.2
  • 4
    • 0035799707 scopus 로고    scopus 로고
    • Lethality and Centrality in Protein Networks
    • brief communications
    • Jeong, H., Mason, S.P., Barabasi, A.L., Oltvai, Z.N.: Lethality and Centrality in Protein Networks. Nature 411 (2001) (brief communications)
    • (2001) Nature , vol.411
    • Jeong, H.1    Mason, S.P.2    Barabasi, A.L.3    Oltvai, Z.N.4
  • 7
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509-512 (1999)
    • (1999) Science , vol.286 , pp. 509-512
    • Barabási, A.L.1    Albert, R.2
  • 8
    • 85028479137 scopus 로고    scopus 로고
    • Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70 (066111) (2004)
    • Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70 (066111) (2004)
  • 9
    • 33646840405 scopus 로고    scopus 로고
    • Network Analysis
    • Brandes, U, Erlebach, T, eds, Springer, Heidelberg
    • Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol. 3418. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3418
  • 11
    • 24144434716 scopus 로고    scopus 로고
    • Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS Graph in 2.5 Dimensions. In: Pach, J. (ed.) GD 2004. LNCS, 3383, pp. 43-48. Springer, Heidelberg (2005)
    • Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS Graph in 2.5 Dimensions. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 43-48. Springer, Heidelberg (2005)
  • 12
    • 84864040903 scopus 로고    scopus 로고
    • Alvarez-Hamelin, J.I., Dall'Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS (2005)
    • Alvarez-Hamelin, J.I., Dall'Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS (2005)
  • 13
    • 0000488788 scopus 로고
    • Network Structure and Minimum Degree
    • Seidman, S.B.: Network Structure and Minimum Degree. Social Networks 5, 269-287 (1983)
    • (1983) Social Networks , vol.5 , pp. 269-287
    • Seidman, S.B.1
  • 14
    • 49949098600 scopus 로고    scopus 로고
    • Freeman, L.C.: A Set of Measures of Centrality Based Upon Betweeness. Sociometry 40, 35-41 (1977)
    • Freeman, L.C.: A Set of Measures of Centrality Based Upon Betweeness. Sociometry 40, 35-41 (1977)
  • 15
    • 8344254420 scopus 로고    scopus 로고
    • Reach-based routing: A new approach to shortest path algorithms optimized for road networks
    • Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: 6th Workshop on Algorithm Engineering and Experiments, pp. 100-111 (2004)
    • (2004) 6th Workshop on Algorithm Engineering and Experiments , pp. 100-111
    • Gutman, R.1
  • 17
    • 84957542241 scopus 로고    scopus 로고
    • Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Tamassia, R., Tollis, I(Y.) G. (eds.) GD 1994, LNCS, 894, pp. 388-403. Springer, Heidelberg (1995)
    • Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Tamassia, R., Tollis, I(Y.) G. (eds.) GD 1994, LNCS, vol. 894, pp. 388-403. Springer, Heidelberg (1995)
  • 18
    • 0030264246 scopus 로고    scopus 로고
    • Drawing graphs nicely using simulated annealing
    • Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15(4), 301-331 (1996)
    • (1996) ACM Trans. Graph , vol.15 , Issue.4 , pp. 301-331
    • Davidson, R.1    Harel, D.2


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