메뉴 건너뛰기




Volumn 7, Issue 1, 2007, Pages

The Web as a graph: How far we are

Author keywords

Graph structure; Models; World wide Web

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; MATHEMATICAL MODELS;

EID: 33847706952     PISSN: 15335399     EISSN: 15576051     Source Type: Journal    
DOI: 10.1145/1189740.1189744     Document Type: Article
Times cited : (38)

References (38)
  • 3
    • 84906244198 scopus 로고    scopus 로고
    • Robustness and vulnerability of scale-free random graphs
    • BOLLOBAS, B. AND RIORDAN, O. 2008. Robustness and vulnerability of scale-free random graphs. Internet Math. 1, 1, 1-85.
    • (2008) Internet Math , vol.1 , Issue.1 , pp. 1-85
    • BOLLOBAS, B.1    RIORDAN, O.2
  • 4
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • BARABASI, A. AND ALBERT, A. 1999. Emergence of scaling in random networks. Science 286, 509.
    • (1999) Science , vol.286 , pp. 509
    • BARABASI, A.1    ALBERT, A.2
  • 7
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual Web search engine
    • BRIN, S. AND PAGE, L. 1998. The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30, 1-7, 107-117.
    • (1998) Comput. Netw. ISDN Syst , vol.30
    • BRIN, S.1    PAGE, L.2
  • 10
    • 33747096982 scopus 로고    scopus 로고
    • CHO, J., GARCIA-MOLINA, H., HAVELIWALA, T., LAM, W., PAEPCKE, A., RAGHAVAN, S., AND WESLEY, G. 2006. Stanford WebBase Components and Applications. ACM Trans. Internet Tech. 6, 2.
    • CHO, J., GARCIA-MOLINA, H., HAVELIWALA, T., LAM, W., PAEPCKE, A., RAGHAVAN, S., AND WESLEY, G. 2006. Stanford WebBase Components and Applications. ACM Trans. Internet Tech. 6, 2.
  • 14
    • 2942529464 scopus 로고    scopus 로고
    • Large scale properties of the Web-graph
    • DOI: 10.1140/epjb/e2004- 00056-6
    • DONATO, D., LAURA, L., LEONARDI, S., AND MILLOZZI, S. 2004a. Large scale properties of the Web-graph. Europ. J. Phys. B 38, 2, 239-243. DOI: 10.1140/epjb/e2004- 00056-6.
    • (2004) Europ. J. Phys. B , vol.38 , Issue.2 , pp. 239-243
    • DONATO, D.1    LAURA, L.2    LEONARDI, S.3    MILLOZZI, S.4
  • 16
    • 33847719663 scopus 로고    scopus 로고
    • A software library for generating and measuring massive Webgraphs. Tech. Rep. D13, COSIN European Research Project, http
    • DONATO, D., LAURA, L., LEONARDI, S., AND MILLOZZI, S. 2004c. A software library for generating and measuring massive Webgraphs. Tech. Rep. D13, COSIN European Research Project, http://www.dis.unirornai.it/~cosin/html_pages/COSIN-Tools.htm.
    • (2004)
    • DONATO, D.1    LAURA, L.2    LEONARDI, S.3    MILLOZZI, S.4
  • 18
    • 33646154492 scopus 로고    scopus 로고
    • Fast Parallel PageRank: A Linear System Approach. Tech
    • Rep. 038, Yahoo! Research
    • GLEICH, D., ZUCHOV, L., AND BEHKHIN, P. 2004. Fast Parallel PageRank: A Linear System Approach. Tech. Rep. 038, Yahoo! Research.
    • (2004)
    • GLEICH, D.1    ZUCHOV, L.2    BEHKHIN, P.3
  • 19
    • 77953071782 scopus 로고    scopus 로고
    • GULLI, A. AND SIGNORINI, A. 2005. The Indexable Web is More than 11.5 Billion Pages. In Proceedings of WWW-05, International Conference on the World Wide Web.
    • GULLI, A. AND SIGNORINI, A. 2005. The Indexable Web is More than 11.5 Billion Pages. In Proceedings of WWW-05, International Conference on the World Wide Web.
  • 20
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading, MA
    • HARAHY, F. 1969. Graph Theory. Addison-Wesley, Reading, MA.
    • (1969) Graph Theory
    • HARAHY, F.1
  • 21
    • 0004255482 scopus 로고    scopus 로고
    • Efficient computation of PageRank
    • Tech. rep, Stanford University
    • HAVELIWALA, T. H. 1999. Efficient computation of PageRank. Tech. rep., Stanford University.
    • (1999)
    • HAVELIWALA, T.H.1
  • 22
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • KLEINBERG, J. 1997. Authoritative sources in a hyperlinked environment. J. ACM46, 5, 604-632.
    • (1997) J. ACM46 , vol.5 , pp. 604-632
    • KLEINBERG, J.1
  • 24
    • 0006740356 scopus 로고    scopus 로고
    • Seminumerical Algorithms
    • Third ed, Addison-Wesley, Reading, Massachusetts
    • KNUTH, D. E. 1997. Seminumerical Algorithms, Third ed. The Art of Computer Programming, vol. 2. Addison-Wesley, Reading, Massachusetts.
    • (1997) The Art of Computer Programming , vol.2
    • KNUTH, D.E.1
  • 29
    • 9544251823 scopus 로고    scopus 로고
    • A brief history of generative models for power law and lognormal distributions
    • MITZENMACHER, M. 2003. A brief history of generative models for power law and lognormal distributions. Internet Math. 1, 2.
    • (2003) Internet Math , vol.1 , pp. 2
    • MITZENMACHER, M.1
  • 30
    • 84922574542 scopus 로고    scopus 로고
    • PANDURANGAN, G., RAGHAVAN, P., AND UPFAL, E. 2002. Using PageRank to characterize Web structure. In. Proceedings of the 8th Annual International Conference on Combinatorics and Computing (COCOON), Springer-Verlag, Ed. LNCS 2387. 330-339.
    • PANDURANGAN, G., RAGHAVAN, P., AND UPFAL, E. 2002. Using PageRank to characterize Web structure. In. Proceedings of the 8th Annual International Conference on Combinatorics and Computing (COCOON), Springer-Verlag, Ed. LNCS 2387. 330-339.
  • 33
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • TARJAN, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2, 146-160.
    • (1972) SIAM J. Comput , vol.1 , Issue.2 , pp. 146-160
    • TARJAN, R.E.1
  • 34
    • 0028484243 scopus 로고
    • Algorithms for parallel memory i: Two-level memories
    • VITTER, J. AND SHRIVER, E. 1994a. Algorithms for parallel memory i: Two-level memories. Algorithmica 12, 2-3, 107-114.
    • (1994) Algorithmica , vol.12
    • VITTER, J.1    SHRIVER, E.2
  • 35
    • 0028486072 scopus 로고
    • Algorithms for parallel memory ii: Hierarchical multilevel memories
    • VITTER, J. AND SHRIVER, E. 1994b. Algorithms for parallel memory ii: Hierarchical multilevel memories. Algorithmica 12, 2-3, 148-169.
    • (1994) Algorithmica , vol.12
    • VITTER, J.1    SHRIVER, E.2
  • 36
    • 0001285808 scopus 로고
    • An efficient method for generating discrete random variables with general distributions
    • WALKER, A. 1977. An efficient method for generating discrete random variables with general distributions. ACM Trans. Math. Softw. 3, 3, 253-256.
    • (1977) ACM Trans. Math. Softw , vol.3 , Issue.3 , pp. 253-256
    • WALKER, A.1
  • 37
    • 33847707530 scopus 로고    scopus 로고
    • webbase. The Stanford Webbase project. http://www-diglib.stanford.edu/ ~testbed/doc2/WebBase/.
    • webbase. The Stanford Webbase project. http://www-diglib.stanford.edu/ ~testbed/doc2/WebBase/.
  • 38
    • 0003990972 scopus 로고    scopus 로고
    • 2nd ed, Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers Inc
    • WITTEN, I. H., MOFFAT, A., AND BELL, T. C. 1999. Managing Gigabytes (2nd ed.): Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers Inc.
    • (1999) Managing Gigabytes
    • WITTEN, I.H.1    MOFFAT, A.2    BELL, T.C.3


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