메뉴 건너뛰기




Volumn 5295, Issue , 2004, Pages 45-56

Exploring the computing literature using temporal graph visualization

Author keywords

Computing literature visualization; Dynamic graph layout algorithms

Indexed keywords

BIBLIOGRAPHICAL DATA; COMPUTING LITERATURE VISUALIZATION; DYNAMIC GRAPH LAYOUT ALGORITHMS; INTERACTIVE VISUALIZATION TOOL;

EID: 8844252263     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.539245     Document Type: Conference Paper
Times cited : (44)

References (26)
  • 1
    • 8844271983 scopus 로고    scopus 로고
    • Characterizing and mining the citation graph of the computer science literature
    • Department of Computer Science, Dalhousie University
    • Y. An, J. Janssen, and E. Milios. Characterizing and mining the citation graph of the computer science literature. Technical Report CS-2001-02, Department of Computer Science, Dalhousie University, 2001.
    • (2001) Technical Report , vol.CS-2001-02
    • An, Y.1    Janssen, J.2    Milios, E.3
  • 3
    • 0000266549 scopus 로고    scopus 로고
    • Some analyses of Erdös collaboration graph
    • V. Batagelj and A. Mrvar. Some analyses of Erdös collaboration graph. Social Networks, 22(2):173-186, 2000.
    • (2000) Social Networks , vol.22 , Issue.2 , pp. 173-186
    • Batagelj, V.1    Mrvar, A.2
  • 6
    • 8844244248 scopus 로고    scopus 로고
    • Dynamic graph drawing
    • M. Kaufmann and D. Wagner, editors, number 2025 in LNCS, chapter 9, Springer-Verlag, Berlin, Germany
    • J. Branke. Dynamic graph drawing. In M. Kaufmann and D. Wagner, editors, Drawing Graphs: Methods and Models, number 2025 in LNCS, chapter 9, pages 228-246. Springer-Verlag, Berlin, Germany, 2001.
    • (2001) Drawing Graphs: Methods and Models , pp. 228-246
    • Branke, J.1
  • 12
    • 0026257928 scopus 로고
    • Graph drawing by force-directed placement
    • T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw. - Pract. Exp., 21(11):1129-1164, 1991.
    • (1991) Softw. - Pract. Exp. , vol.21 , Issue.11 , pp. 1129-1164
    • Fruchterman, T.1    Reingold, E.2
  • 14
    • 0000505726 scopus 로고
    • A portion of the well-known collaboration graph
    • J. Grossman and P. Ion. A portion of the well-known collaboration graph. Congressus Numerantium, 108:129-131, 1995.
    • (1995) Congressus Numerantium , vol.108 , pp. 129-131
    • Grossman, J.1    Ion, P.2
  • 16
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inform. Process. Lett., 31:7-15, 1989.
    • (1989) Inform. Process. Lett. , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 17
    • 0031103689 scopus 로고    scopus 로고
    • Referral Web: Combining social networks and collaborative filtering
    • H. Kautz, B. Selman, and M. Shah. Referral Web: Combining social networks and collaborative filtering. Communications of the ACM, 40(3):63-65, 1997.
    • (1997) Communications of the ACM , vol.40 , Issue.3 , pp. 63-65
    • Kautz, H.1    Selman, B.2    Shah, M.3
  • 20
    • 0000116106 scopus 로고    scopus 로고
    • Who is the best connected scientist? A study of scientific coauthorship networks
    • M. E. J. Newman. Who is the best connected scientist? A study of scientific coauthorship networks. Physics Review, E64, 2001.
    • (2001) Physics Review , vol.E64
    • Newman, M.E.J.1
  • 25
    • 0032047559 scopus 로고    scopus 로고
    • Visualizing a discipline: An author co-citation analysis of information science, 1972-1995
    • H. D. White and K. W. McCain. Visualizing a discipline: an author co-citation analysis of information science, 1972-1995. Journal of the American Society for Information Science, 49(4):327-355, 1998.
    • (1998) Journal of the American Society for Information Science , vol.49 , Issue.4 , pp. 327-355
    • White, H.D.1    McCain, K.W.2


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