메뉴 건너뛰기




Volumn 12, Issue 6, 2006, Pages 1386-1398

Generating graphs for visual analytics through interactive sketching

Author keywords

Data and knowledge visualization; Graphs and networks; Information visualization; Visualization techniques and methodologies

Indexed keywords

DATA VISUALIZATION; GRAPH MODEL THEORY; HUMAN CENTRIC DESIGN; KNOWLEDGE VISUALIZATION;

EID: 33749507181     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2006.91     Document Type: Article
Times cited : (22)

References (32)
  • 1
    • 0035627527 scopus 로고    scopus 로고
    • A random graph model for power law graphs
    • W. Aiello, F. Chung, and L. Lu, "A Random Graph Model for Power Law Graphs," Experimental Math., vol. 10, pp., 53-66, 2001.
    • (2001) Experimental Math. , vol.10 , pp. 53-66
    • Aiello, W.1    Chung, F.2    Lu, L.3
  • 2
    • 0142077573 scopus 로고    scopus 로고
    • Topology of evolving networks: Local events and universality
    • The Am. Physical Soc.
    • R. Albert and A.-L. Barabasi, "Topology of Evolving Networks: Local Events and Universality," Physical Rev. Letters, vol. 85, no. 24, pp. 5234-5237, The Am. Physical Soc., 2000.
    • (2000) Physical Rev. Letters , vol.85 , Issue.24 , pp. 5234-5237
    • Albert, R.1    Barabasi, A.-L.2
  • 5
    • 1942450195 scopus 로고    scopus 로고
    • A visual language for querying and updating graphs
    • 2002-037, Univ. of Mass. Amherst Computer Science
    • H. Blau, N. Immerman, and D. Jensen, "A Visual Language for Querying and Updating Graphs," Technical Report, 2002-037, Univ. of Mass. Amherst Computer Science, 2002.
    • (2002) Technical Report
    • Blau, H.1    Immerman, N.2    Jensen, D.3
  • 13
    • 0033204106 scopus 로고    scopus 로고
    • On power-law relationships of the Internet topology
    • Sept.
    • M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On Power-Law Relationships of the Internet Topology," Proc. ACM SIGCOMM, pp. 251-262, Sept. 1999.
    • (1999) Proc. ACM SIGCOMM , pp. 251-262
    • Faloutsos, M.1    Faloutsos, P.2    Faloutsos, C.3
  • 14
    • 84859685380 scopus 로고    scopus 로고
    • GD96 Contest, 2006, http://www.research.att.com/conf/gd96/contest.html.
    • (2006) GD96 Contest
  • 15
    • 16244398384 scopus 로고    scopus 로고
    • A comparison of the readability of graphs using node-link and matrix-based representations
    • Oct.
    • M. Ghoniem, J.-D. Fekete, and P. Castagliola, "A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations," Proc. IEEE Symp. Information Visualization, pp. 17-24, Oct. 2004.
    • (2004) Proc. IEEE Symp. Information Visualization , pp. 17-24
    • Ghoniem, M.1    Fekete, J.-D.2    Castagliola, P.3
  • 16
    • 0024640140 scopus 로고
    • An algorithm, for drawing general. undirected graphs
    • Apr.
    • T. Kamada and S. Kawai, "An Algorithm, for Drawing General. Undirected Graphs," Information Processing Letters, vol. 31, no. 1, pp. 7-15, Apr. 1989.
    • (1989) Information Processing Letters , vol.31 , Issue.1 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 17
    • 0002687371 scopus 로고
    • The small world problem
    • S. Milgram, "The Small World Problem," Psychology Today, vol. 2, pp. 60-67, 1967.
    • (1967) Psychology Today , vol.2 , pp. 60-67
    • Milgram, S.1
  • 18
    • 4444307284 scopus 로고    scopus 로고
    • Clustering and preferential attachment in growing networks
    • Santa Fe Inst., Santa Fe, NM
    • M.E.J. Newman, "Clustering and Preferential Attachment in Growing Networks," Technical Report, Santa Fe Inst., Santa Fe, NM, 2006, http://www.santafe.edu/sfi/publications/Working-Papers/01-03-021.pdf.
    • (2006) Technical Report
    • Newman, M.E.J.1
  • 19
    • 0013465021 scopus 로고    scopus 로고
    • Random graphs as models of networks
    • S. Bornholdt and H.G. Schuster, eds. Berlin: Wiley-VCH
    • M.E.J. Newman, "Random Graphs as Models of Networks," Handbook of Graphs and Networks, S. Bornholdt and H.G. Schuster, eds. Berlin: Wiley-VCH, 2002.
    • (2002) Handbook of Graphs and Networks
    • Newman, M.E.J.1
  • 21
    • 84859683606 scopus 로고    scopus 로고
    • QGraph, http://kdl.cs.umass.edu/proximity/documentation/ qgraph/, 2006.
    • (2006) QGraph
  • 26
    • 78649541417 scopus 로고    scopus 로고
    • Using multilevel call matrices in large software projects
    • F. van Ham, "Using Multilevel Call Matrices in Large Software Projects," Proc. IEEE Symp. Information Visualization, pp. 227-232, 2003.
    • (2003) Proc. IEEE Symp. Information Visualization , pp. 227-232
    • Van Ham, F.1
  • 27
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of 'small-world' networks
    • Macmillan
    • D.J. Watts and S.H. Strogatz, "Collective Dynamics of 'Small-World' Networks," Nature, pp. 440-442, Macmillan, 1998.
    • (1998) Nature , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 29
    • 0024123493 scopus 로고
    • Routing of multipoint connections
    • Dec.
    • B.M. Waxman, "Routing of Multipoint Connections," IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
    • (1988) IEEE J. Selected Areas in Comm. , vol.6 , Issue.9 , pp. 1617-1622
    • Waxman, B.M.1
  • 31
    • 0008576592 scopus 로고    scopus 로고
    • On parallelization of static scheduling algorithms
    • Aug.
    • M.-Y. Wu and W. Shu, "On Parallelization of Static Scheduling Algorithms," IEEE Trans. Software Eng., vol. 23, no. 8, Aug. 1997.
    • (1997) IEEE Trans. Software Eng. , vol.23 , Issue.8
    • Wu, M.-Y.1    Shu, W.2


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