Skip to main content

Workshop on Algorithms and Models for the Web Graph

  • Conference paper
Book cover Algorithms and Models for the Web-Graph (WAW 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4936))

Included in the following conference series:

Abstract

For barely a decade now the Web graph (the network formed by Web pages and their hyperlinks) has been the focus of scientific study. In that short a time, this study has made a significant impact on research in physics, computer science and mathematics. It has focussed the attention of the scientific community on all the different kinds of networks that have arisen through technology and human activity; some speak of a “new science of networks”. It has brought the computational and deductive power of computer science to the study of the complex social networks formed by inter-human relationships. And, it has given birth to new branches of research in different areas of mathematics, most notably graph theory and probability.

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

Access this chapter

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. Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 28, 509–512 (1999)

    Google Scholar 

  2. Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Structures and Algorithms 18, 279–290 (2000)

    Article  Google Scholar 

  3. Bonato, A.: A survey of models of the web graph. In: Hamel, López-Ortiz (eds.) CAAN 2006. LNCS, Springer, Heidelberg (2004)

    Google Scholar 

  4. Brin, S., Page, L.: The Anatomy of a Large-Scale Hypertextual Web Search Engine. Computer Networks and ISDN Systems 33, 107–117 (1998)

    Article  Google Scholar 

  5. Broder, A., Kumar, R., Maghoul, F., Rahaghavan, P., Rajagopalan, S., State, R., Tomkins, A., Wiener, J.: Graph structure in the web. In: Proceedings of the 9th International World-Wide Web Conference (WWW), pp. 309–320 (2000)

    Google Scholar 

  6. Langville, A., Meyer, C.: Deeper inside PageRank. Internet Mathematics 1(3), 335–380 (2004)

    MathSciNet  MATH  Google Scholar 

  7. Aiello, W., Chung, F., Lu, L.: Random evolution in massive graphs. In: Abello, J., et al. (eds.) Handbook on Massive Data Sets, pp. 97–122. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  8. Cooper, C., Frieze, A.: On a general model of web graphs. Random Structures and Algorithms 22, 311–335 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

William Aiello Andrei Broder Jeannette Janssen Evangelos Milios

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aiello, W., Broder, A., Janssen, J., Milios, E. (2008). Workshop on Algorithms and Models for the Web Graph. In: Aiello, W., Broder, A., Janssen, J., Milios, E. (eds) Algorithms and Models for the Web-Graph. WAW 2006. Lecture Notes in Computer Science, vol 4936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78808-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78808-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78807-2

  • Online ISBN: 978-3-540-78808-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics