메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 145-151

Visual unrolling of network evolution and the analysis of dynamic discourse

Author keywords

Animation; Application software; Computer networks; Data visualization; Engineering drawings; Humans; Information science; Social network services; Software engineering; Text analysis

Indexed keywords

ANIMATION; APPLICATION PROGRAMS; COMPUTER NETWORKS; INFORMATION ANALYSIS; INFORMATION SCIENCE; INFORMATION SYSTEMS; SOCIAL SCIENCES COMPUTING; SOFTWARE ENGINEERING; VISUALIZATION;

EID: 79955680195     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFVIS.2002.1173160     Document Type: Conference Paper
Times cited : (38)

References (18)
  • 1
    • 0007334606 scopus 로고
    • Technical Report Stichting Mathematisch Centrum, Amsterdam, Oct
    • J. M. Anthonisse. The rush in a directed graph. Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam, Oct. 1971.
    • (1971) The Rush in a Directed Graph
    • Anthonisse, J.M.1
  • 2
    • 0035648637 scopus 로고    scopus 로고
    • A faster algorithm for betweenness centrality
    • U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001.
    • (2001) Journal of Mathematical Sociology , vol.25 , Issue.2 , pp. 163-177
    • Brandes, U.1
  • 4
    • 84957380248 scopus 로고    scopus 로고
    • A Bayesian paradigm for dynamic graph layout
    • Proc. 5th Intl. Symp. Graph Drawing (GD '97), Springer
    • U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In Proc. 5th Intl. Symp. Graph Drawing (GD '97), LNCS 1353:236-247. Springer, 1997.
    • (1997) LNCS , vol.1353 , pp. 236-247
    • Brandes, U.1    Wagner, D.2
  • 5
    • 8844244248 scopus 로고    scopus 로고
    • Dynamic graph drawing
    • M. Kaufmann and D. Wagner, editors, Drawing Graphs: Methods and Models, Springer
    • J. Branke. Dynamic graph drawing. In M. Kaufmann and D. Wagner, editors, Drawing Graphs: Methods and Models, LNCS Tutorial 2025:228-246. Springer, 2001.
    • (2001) LNCS Tutorial , vol.2025 , pp. 228-246
    • Branke, J.1
  • 8
    • 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 Transactions on Computer-Human Interaction, 4(3):197-229, 1997.
    • (1997) ACM Transactions on Computer-Human Interaction , vol.4 , Issue.3 , pp. 197-229
    • Cohen, J.D.1
  • 9
    • 0036252735 scopus 로고    scopus 로고
    • Studying complex discursive systems: Centering resonance analysis of communication
    • S. R. Corman, T. Kuhn, R. D. McPhee, and K. J. Dooley. Studying complex discursive systems: Centering resonance analysis of communication. Human Communication Research, 28(2):157-206, 2002.
    • (2002) Human Communication Research , vol.28 , Issue.2 , pp. 157-206
    • Corman, S.R.1    Kuhn, T.2    McPhee, R.D.3    Dooley, K.J.4
  • 10
    • 84865730611 scopus 로고
    • A set of measures of centrality based on betweenness
    • L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40:35-41, 1977.
    • (1977) Sociometry , vol.40 , pp. 35-41
    • Freeman, L.C.1
  • 11
    • 84867483720 scopus 로고    scopus 로고
    • Graph drawing in motion II
    • Proc. 9th Intl. Symp. Graph Drawing (GD '01), Springer
    • C. Friedrich and M. E. Houle. Graph drawing in motion II. Proc. 9th Intl. Symp. Graph Drawing (GD '01), LNCS 2265:220-231. Springer, 2002.
    • (2002) LNCS , vol.2265 , pp. 220-231
    • Friedrich, C.1    Houle, M.E.2
  • 14
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
    • (1989) Information Processing Letters , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2


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