메뉴 건너뛰기




Volumn 32, Issue 3 PART1, 2013, Pages 61-70

Visual analysis of set relations in a graph

Author keywords

[No Author keywords available]

Indexed keywords

WEBSITES;

EID: 84879801327     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/cgf.12093     Document Type: Article
Times cited : (18)

References (29)
  • 3
    • 79953194450 scopus 로고    scopus 로고
    • Blocks of hypergraphs
    • In, Iliopoulos C. Smyth W. (Eds.), 6460 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2.
    • Brandes U., Cornelsen S., Pampel B., Sallaberry A.,: Blocks of hypergraphs. In Combinatorial Algorithms, Iliopoulos C., Smyth W., (Eds.), vol. 6460 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011, pp. 201-211. 2.
    • (2011) Combinatorial Algorithms , pp. 201-211
    • Brandes, U.1    Cornelsen, S.2    Pampel, B.3    Sallaberry, A.4
  • 5
    • 84903847468 scopus 로고    scopus 로고
    • Drawing Hypergraphs in the Subset Standard (Short Demo Paper)
    • Graph Drawing
    • Bertault F., Eades P.,: Drawing hypergraphs in the subset standard (short demo paper). In Graph Drawing, Marks J., (Ed.), vol. 1984 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2001, pp. 164-169. 2. (Pubitemid 33243327)
    • (2001) Lecture Notes in Computer Science , Issue.1984 , pp. 164-169
    • Bertault, F.1    Eades, P.2
  • 6
    • 82555195625 scopus 로고    scopus 로고
    • 2nd workshop on information heterogeneity and fusion in recommender systems (hetrec 2011)
    • In (New York, NY, USA), RecSys 2011, ACM, 7.
    • Cantador I., Brusilovsky P., Kuflik T.,: 2nd workshop on information heterogeneity and fusion in recommender systems (hetrec 2011). In Proceedings of the 5th ACM conference on Recommender systems (New York, NY, USA, 2011), RecSys 2011, ACM, pp. 387-388. 7.
    • (2011) Proceedings of the 5th ACM Conference on Recommender Systems , pp. 387-388
    • Cantador, I.1    Brusilovsky, P.2    Kuflik, T.3
  • 12
    • 84986517167 scopus 로고
    • Hypergraph planarity and the complexity of drawing venn diagrams
    • 2.
    • Johnson D. S., Pollak H. O.,: Hypergraph planarity and the complexity of drawing venn diagrams. Journal of Graph Theory 11, 3 (1987), 309-325. 2.
    • (1987) Journal of Graph Theory , vol.11 , Issue.3 , pp. 309-325
    • Johnson, D.S.1    Pollak, H.O.2
  • 13
    • 68749122331 scopus 로고    scopus 로고
    • Springer-Verlag, Berlin, Heidelberg, ch. Subdivision Drawings of Hypergraphs, 2.
    • Kaufmann M., Kreveld M., Speckmann B.,: Graph drawing. Springer-Verlag, Berlin, Heidelberg, 2009, ch. Subdivision Drawings of Hypergraphs, pp. 396-407. 2.
    • (2009) Graph Drawing , pp. 396-407
    • Kaufmann, M.1    Kreveld, M.2    Speckmann, B.3
  • 14
    • 84863564464 scopus 로고    scopus 로고
    • Graphprism: Compact visualization of network structure
    • 2
    • Kairam S., MacLean D., Savva M., Heer J.,: Graphprism: compact visualization of network structure. In AVI (2012), pp. 498-505. 2.
    • (2012) AVI , pp. 498-505
    • Kairam, S.1    Maclean, D.2    Savva, M.3    Heer, J.4
  • 15
    • 84879810032 scopus 로고    scopus 로고
    • Last.fm, Dec. 2012. 6.
    • Last.fm, Dec. 2012. 6.
  • 18
  • 19
  • 22
    • 68549097884 scopus 로고    scopus 로고
    • Fully automatic visualisation of overlapping sets
    • 2.
    • Simonetto P., Auber D., Archambault D.,: Fully automatic visualisation of overlapping sets. Computer Graphics Forum 28, 3 (2009), 967-974. 2.
    • (2009) Computer Graphics Forum , vol.28 , Issue.3 , pp. 967-974
    • Simonetto, P.1    Auber, D.2    Archambault, D.3


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