Skip to main content
SpringerLink
Log in

Graph-Theoretic Web Algorithms: An Overview

  • Conference paper
  • First Online:
Innovative Internet Computing Systems (IICS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2060))

Included in the following conference series:

Abstract

The World Wide Web is growing rapidly and revolutionizing the means of information access. It can be modeled as a directed graph in which a node represents a Web page and an edge represents a hyperlink. Currently the number of nodes in this gigantic Web graph is over four billion and is growing by more than seven million nodes a day—without any centralized control. The study of this graph is essential for designing efficient algorithms for crawling, searching, and ranking Web resources. Knowledge of the structure of the Web graph can be also exploited for attaining efficiency and comprehensiveness in Web navigation. This paper describes algorithms for graph-theoretic analysis of the Web.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamic, L., Huberman, B.: Technical comment to ‘Emergence of scaling in random networks’. Science, Vol. 287. (Mar. 2000) 2115

    Article  Google Scholar 

  2. Bar-Yossef, Z., Berg, A., Chien, S., Fakcharoenphol, J., Weitz, D.: Approximating aggregate queries about Web pages via random walks. Proceedings of the 26th Int. Conf. on Very Large Databases, Cairo, Egypt (Sept. 10-14, 2000) 535–544

    Google Scholar 

  3. Barabási, A., Albert, R.: Emergence of scaling in random networks. Science, Vol. 286. (Oct. 1999) 509–512

    Article  MathSciNet  Google Scholar 

  4. Bharat, K., Henzinger, M.: Improved algorithms for topic distillation in a hyperlinked environment. Proceedings of the 21st ACM SIGIR Conf. on Research and Development in Information Retrieval, Melbourne, Australia (Aug. 24-28, 1998) 104–111

    Google Scholar 

  5. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web: Experiments and models. Proceedings of the 9th Int. WWW Conf., Amsterdam, The Netherlands (May 15-19, 2000)

    Google Scholar 

  6. Dean, J., Henzinger, M.: Finding related pages in the World Wide Web. Proceedings of the 8th Int. WWW Conf., Toronto, Canada (May 11-14, 1999)

    Google Scholar 

  7. Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, Englewood Cliffs, NJ (1974)

    MATH  Google Scholar 

  8. Deo, N, Gupta, P.: World Wide Web: A graph-theoretic perspective. Technical Report CSTR-01-001, School of Computer Science, University of Central Florida, Orlando, FL (Mar. 2001) (http://www.cs.ucf.edu/~pgupta/publication.html)

    Google Scholar 

  9. Erdös, P., Rényi, A.: On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, Vol. 5. (1960) 17–61

    MATH  Google Scholar 

  10. Gibson, D., Kleinberg, J., Raghavan, P.: Structural analysis of the World Wide Web. WWW Consortium Web Characterization Workshop, Cambridge, MA (Nov. 5, 1998)

    Google Scholar 

  11. Huberman, B., Adamic, L.: Growth dynamics of the World-Wide Web. Nature, Vol. 401. (Sept. 1999) 131

    Google Scholar 

  12. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. Technical Report 99-1776, Department of Computer Science, Cornell University, Ithaca, NY (Oct. 1999)

    Google Scholar 

  13. Kleinberg, J., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: The Web as a graph: Measurements, models and methods, Lecture Notes in Computer Science, Vol. 1627. Springer-Verlag, Berlin Heidelberg New York (July 1999) 1–17

    Google Scholar 

  14. Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. Proceedings of the 8th Int. WWW Conf., Toronto, Canada (May 11-14, 1999)

    Google Scholar 

  15. Moore, A., Murray, B. H.: Sizing the Web. Cyveilliance, Inc. White Paper, (July 10, 2000) (http://www.cyveillance.com/resources/7921S_Sizing_the_Internet.pdf)

  16. Newman, M. E. J., Moore, C., Watts, D.: Mean-field solution of the small-world network model. Working Paper 99-09-066, Santa Fe Institute, Santa Fe, NM (Sept. 1999)

    Google Scholar 

  17. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Stanford Digital Library Project, Working Paper SIDL-WP-1999-0120, Stanford University, CA (1999)

    Google Scholar 

  18. Pirolli, P., Pitkow, P., Rao, R.: Silk from a sow’racting usable structures from the Web. Proceedings of the ACM Conf. on Human factors in Computing, Vancouver, Canada (Apr. 13-18, 1996) 118–125

    Google Scholar 

  19. Rafiei, D., Mendelzon, A.: What is this page known for?ng Web page reputations. Proceedings of the 9th Int. WWW Conf., Amsterdam, The Netherlands (May 15-19, 2000)

    Google Scholar 

  20. Watts, D.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton, NJ (1999)

    Google Scholar 

  21. Zhang, D., Dong, Y.: An efficient algorithm to rank Web resources. Proceedings of the 9th Int. WWW Conf., Amsterdam, The Netherlands (May 15-19, 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Central Florida, Orlando, FL, 2816, USA

    Narsingh Deo & Pankaj Gupta

Authors
  1. Narsingh Deo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pankaj Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematik, Technische Universität Ilmenau, Postfach10 05 65, 98684, Ilmenau, Germany

    Thomas Böhme

  2. Fachbereich Informatik, Universität Rostock, Albert-Einstein-Str. 23, 18051, Rostock, Germany

    Herwig Unger

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deo, N., Gupta, P. (2001). Graph-Theoretic Web Algorithms: An Overview. In: Böhme, T., Unger, H. (eds) Innovative Internet Computing Systems. IICS 2001. Lecture Notes in Computer Science, vol 2060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48206-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48206-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42275-4

  • Online ISBN: 978-3-540-48206-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation