메뉴 건너뛰기




Volumn 9, Issue 1, 2005, Pages 7-18

Drawing graphs within graphs

Author keywords

[No Author keywords available]

Indexed keywords

CASE-STUDIES; GRAPH DRAWING; NETWORK MOTIF; SMALL NETWORKS; SUBGRAPHS;

EID: 27744466142     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00097     Document Type: Conference Paper
Times cited : (4)

References (12)
  • 2
    • 84957366611 scopus 로고    scopus 로고
    • Graph clustering 1: Cycles of cliques
    • Proceedings of the Graph Drawing 1997, Berlin, Germany. Springer
    • F. J. Brandenburg. Graph clustering 1: Cycles of cliques. In Proceedings of the Graph Drawing 1997, volume 1353 of Lecture Notes in Computer Science, Berlin, Germany, 1997. Springer.
    • (1997) Lecture Notes in Computer Science , vol.1353
    • Brandenburg, F.J.1
  • 5
    • 85039373097 scopus 로고    scopus 로고
    • Graph Drawing Contest 2003. http://www.infosun.fmi.uni-passau.de/br/ lehrstuhl/GraphDrawing/GD2003/contest.html.
    • Graph Drawing Contest 2003
  • 8
    • 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(1):7-15, 1989.
    • (1989) Information Processing Letters , vol.31 , Issue.1 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 10
    • 27744545716 scopus 로고    scopus 로고
    • Graph drawing, 12th international symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, revised selected papers
    • Springer
    • J. Pach, editor. Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers, volume 3383 of Lecture Notes in Computer Science. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3383
    • Pach, J.1
  • 11
    • 0037174670 scopus 로고    scopus 로고
    • Network motifs: Simple building blocks of complex networks
    • S. Shen-Orr, R. Milo, S. Mangan, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298:824-827, 2002.
    • (2002) Science , vol.298 , pp. 824-827
    • Shen-Orr, S.1    Milo, R.2    Mangan, S.3    Alon, U.4
  • 12
    • 85039371758 scopus 로고    scopus 로고
    • yEd Java Graph Editor
    • yEd Java Graph Editor. http://www.yworks.com/en/products_yed_about.htm.


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