메뉴 건너뛰기




Volumn 2, Issue 1, 2003, Pages 40-50

Visual unrolling of network evolution and the analysis of dynamic discourse

Author keywords

betweenness centrality; centering resonance analysis; Dynamic network visualization; graph drawing; network text analysis

Indexed keywords


EID: 84997941498     PISSN: 14738716     EISSN: 14738724     Source Type: Journal    
DOI: 10.1057/palgrave.ivs.9500037     Document Type: Article
Times cited : (105)

References (26)
  • 2
    • 8844244248 scopus 로고    scopus 로고
    • Dynamic graph drawing
    • In: KaufmannM, WagnerD, (Eds.). Lecture Notes in Computer Science, Springer: Berlin
    • Branke J. Dynamic graph drawing. In: KaufmannM, WagnerD, (Eds.). Drawing Graphs: Methods and Models, Lecture Notes in Computer Science, Vol. 2025. Springer: Berlin, 2001; 228–246.
    • (2001) Drawing Graphs: Methods and Models , vol.2025 , pp. 228-246
    • Branke, J.1
  • 4
    • 84867483720 scopus 로고    scopus 로고
    • Ninth International Symposium on Graph Drawing (GD 1901), Lecture Notes in Computer Science, Springer: Berlin
    • Friedrich C, Houle ME. Graph drawing in motion II. Ninth International Symposium on Graph Drawing (GD 1901), Lecture Notes in Computer Science, Vol. 2265. Springer: Berlin, 2002; 220–231.
    • (2002) Graph drawing in motion II , vol.2265 , pp. 220-231
    • Friedrich, C.1    Houle, M.E.2
  • 5
    • 84948663886 scopus 로고    scopus 로고
    • Sixth International Conference on Information Visualisation (IV 1902), IEEE Computer Society Press: Silver spring, MD
    • Dwyer T, Eades P. Visualising a fund manager flow graph with columns and worms. Sixth International Conference on Information Visualisation (IV 1902), IEEE Computer Society Press: Silver spring, MD, 2002; 147–152.
    • (2002) Visualising a fund manager flow graph with columns and worms , pp. 147-152
    • Dwyer, T.1    Eades, P.2
  • 6
    • 0036252735 scopus 로고    scopus 로고
    • Studying complex discursive systems: Centering resonance analysis of communication
    • Corman SR, Kuhn T, McPhee RD, Dooley KJ. Studying complex discursive systems: Centering resonance analysis of communication. Human Communication Research 2002; 28: 157–206.
    • (2002) Human Communication Research , vol.28 , pp. 157-206
    • Corman, S.R.1    Kuhn, T.2    McPhee, R.D.3    Dooley, K.J.4
  • 8
    • 0004275758 scopus 로고
    • Indiana University Press: Bloomington, IN
    • Hopper R. Telephone Conversation. Indiana University Press: Bloomington, IN, 1992.
    • (1992) Telephone Conversation
    • Hopper, R.1
  • 16
    • 0007334606 scopus 로고
    • Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam, October.
    • Anthonisse JM. The rush in a directed graph. Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam, October. 1971.
    • (1971) The rush in a directed graph
    • Anthonisse, J.M.1
  • 17
    • 84865730611 scopus 로고
    • A set of measures of centrality based on betweenness
    • Freeman LC. A set of measures of centrality based on betweenness. Sociometry 1977; 40: 35–41.
    • (1977) Sociometry , vol.40 , pp. 35-41
    • Freeman, L.C.1
  • 18
    • 0035648637 scopus 로고    scopus 로고
    • A faster algorithm for betweenness centrality
    • Brandes U. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 2001; 25: 163–177.
    • (2001) Journal of Mathematical Sociology , vol.25 , pp. 163-177
    • Brandes, U.1
  • 20
    • 84957380248 scopus 로고    scopus 로고
    • Fifth International Symposium on Graph Drawing (GD 1997), Lecture Notes in Computer Science Springer: Berlin
    • Brandes U, Wagner D. A Bayesian paradigm for dynamic graph layout. Fifth International Symposium on Graph Drawing (GD 1997), Lecture Notes in Computer Science, Vol. 1353, Springer: Berlin, 1997; 236–247.
    • (1997) A Bayesian paradigm for dynamic graph layout , vol.1353 , pp. 236-247
    • Brandes, U.1    Wagner, D.2
  • 21
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • Kamada T, Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters 1989; 31: 7–15.
    • (1989) Information Processing Letters , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 22
    • 0009428249 scopus 로고    scopus 로고
    • Drawing graphs to convey proximity: An incremental arrangement method
    • Cohen JD. Drawing graphs to convey proximity: An incremental arrangement method. ACM Transactions on Computer-human Interaction. 1997; 4: 197–229.
    • (1997) ACM Transactions on Computer-human Interaction , vol.4 , pp. 197-229
    • Cohen, J.D.1
  • 23
    • 77956545247 scopus 로고    scopus 로고
    • Ninth International Symposium on Graph Drawing (GD 1901), Lecture Notes in Computer Science, Springer: Berlin
    • Wiese R, Eiglsperger M, Kaufmann M. yFiles: visualization and automatic layout of graphs. Ninth International Symposium on Graph Drawing (GD 1901), Lecture Notes in Computer Science, Vol. 2265: Springer: Berlin, 2002; 453–454.
    • (2002) yFiles: visualization and automatic layout of graphs , vol.2265 , pp. 453-454
    • Wiese, R.1    Eiglsperger, M.2    Kaufmann, M.3


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