메뉴 건너뛰기




Volumn 3843 LNCS, Issue , 2006, Pages 480-491

WhatsOnWeb: Using graph drawing to search the Web

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; DRAWING (GRAPHICS); SEMANTICS; USER INTERFACES; WORLD WIDE WEB;

EID: 33745665822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_43     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 1
    • 0034248999 scopus 로고    scopus 로고
    • Computing orthogonal drawings with the minimum number of bends
    • P. Bertolazzi, G. D. Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. IEEE Trans. on Comp., 49(8):826-840, 2000.
    • (2000) IEEE Trans. on Comp. , vol.49 , Issue.8 , pp. 826-840
    • Bertolazzi, P.1    Battista, G.D.2    Didimo, W.3
  • 2
    • 0242507628 scopus 로고    scopus 로고
    • Communities in graphs
    • Innovative Internet Community Systems (IICS'0S)
    • M. Brinkmeier. Communities in graphs. In Innovative Internet Community Systems (IICS'0S), volume 2877 of LNCS, 2003.
    • (2003) LNCS , vol.2877
    • Brinkmeier, M.1
  • 3
    • 84958970362 scopus 로고    scopus 로고
    • Orthogonal and quasi-upward drawings with vertices of prescribed sizes
    • Graph Drawing (GD '99)
    • G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of prescribed sizes. In Graph Drawing (GD '99), volume 1731 of LNCS., pages 297-310, 1999.
    • (1999) LNCS , vol.1731 , pp. 297-310
    • Di Battista, G.1    Didimo, W.2    Patrignani, M.3    Pizzonia, M.4
  • 5
    • 24144447265 scopus 로고    scopus 로고
    • A topology-driven approach to the design of web meta-search clustering engines
    • SOFSEM '05
    • E. Di Giacomo, W. Didimo, L. Grilli, and G. Liotta. A topology-driven approach to the design of web meta-search clustering engines. In SOFSEM '05, volume 3381 of LNCS., pages 106-116, 2005.
    • (2005) LNCS , vol.3381 , pp. 106-116
    • Di Giacomo, E.1    Didimo, W.2    Grilli, L.3    Liotta, G.4
  • 7
    • 0034515528 scopus 로고    scopus 로고
    • A clustering algorithm based on graph connectivity
    • E. Hartuv and R. Shamir. A clustering algorithm based on graph connectivity. Information Processing Letters, 76:175-181, 2000.
    • (2000) Information Processing Letters , vol.76 , pp. 175-181
    • Hartuv, E.1    Shamir, R.2
  • 8
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E 69, 2004.
    • (2004) Phys. Rev. E , vol.69
    • Newman, M.E.J.1    Girvan, M.2
  • 11
    • 0033294891 scopus 로고    scopus 로고
    • Grouper: A dynamic clustering interface to web search results
    • O. Zamir and O. Etzioni. Grouper: a dynamic clustering interface to web search results. Computer Networks, 31(11-16):1361-1374, 1999.
    • (1999) Computer Networks , vol.31 , Issue.11-16 , pp. 1361-1374
    • Zamir, O.1    Etzioni, O.2


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