메뉴 건너뛰기




Volumn , Issue , 2004, Pages 17-24

A comparison of the readability of graphs using node-link and matrix-based representations

Author keywords

Adjacency matrices; Evaluation; Node link representation; Readability; Visualization of graphs

Indexed keywords

ADJACENCY MATRICS; DISPLAY ALGORITHMS; NODE-LINK REPRESENTATION; READABILITY; VISUALIZATION OF GRAPHS;

EID: 16244398384     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFVIS.2004.1     Document Type: Conference Paper
Times cited : (351)

References (14)
  • 2
    • 84860099673 scopus 로고    scopus 로고
    • http://www.research.att.com/sw/tools/graphviz/
  • 8
    • 78649541417 scopus 로고    scopus 로고
    • Using multilevel call matrices in large software projects
    • (Seattle, WA, USA), IEEE Press
    • Ham, F.v., Using Multilevel Call Matrices in Large Software Projects, in Proc. IEEE Symp, Information Visualization 2003, (Seattle, WA, USA, 2003), IEEE Press, 227-232.
    • (2003) Proc. IEEE Symp, Information Visualization 2003 , pp. 227-232
    • Ham, F.V.1
  • 10
    • 84860101819 scopus 로고    scopus 로고
    • ISPT, Waseda University. Random Graph Server. http://www.ispt.waseda.ac. jp/rgs/index.html
    • Random Graph Server


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