Colin Cooper
- D. Achlioptas, A. Fiat, A. R. Karlin and F. McSherry, Web search via hub synthesis, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (2001) 500--509.]] Google Scholar
Digital Library
- M. Adler and M. Mitzenmacher, Toward Compressing Web Graphs}, To appear in the 2001 Data Compression Conference.]] Google ScholarDigital Library
- W. Aiello, F. Chung and L. Lu, Random evolution in massive graphs, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (2001) 510--519.]] Google ScholarDigital Library
- R. Albert, A. Barabasi and H. Jeong. Diameter of the world wide web. Nature 401:103-131 (1999) see also http://xxx.lanl.gov/abs/cond-mat/9907038+]]Google Scholar
- B. Bollobás, O. Riordan and J. Spencer, The degree sequence of a scale free random graph process, to appear.]]Google Scholar
- B. Bollobás and O. Riordan, The diameter of a scale free random graph, to appear.]]Google Scholar
- A. Broder, R. Kumar, F.Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins and J. Wiener. Graph structure in the web. http://gatekeeper.dec.com/pub/DEC/SRC/publications/stata/www9.htm]]Google Scholar
- C. Cooper and A.M. Frieze, A general model of web graphs, Proceedings of ESA 2001, 500--511.]] Google ScholarDigital Library
- E. Drinea, M. Enachescu and M. Mitzenmacher, Variations on random graph models for the web.]]Google Scholar
- M.R. Henzinger, A. Heydon, M. Mitzenmacher and M. Najork, Measuring Index Quality Using Random Walks on the Web, WWW8 Computer Networks 31 (1999) 1291--1303.]] Google ScholarDigital Library
- W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13--30.]]Google ScholarCross Ref
- R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. The web as a graph. www.almaden.ibm.com+]]Google Scholar
- R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. Stochastic models for the web graph. www.almaden.ibm.com+]]Google Scholar
- A. Sinclair and M. Jerrum, Approximate counting, uniform generation, and rapidly mixing Markov chains, Information and Computation 82 (1989) 93--133.]] Google ScholarDigital Library
Index Terms
- Crawling on web graphs
Recommendations
Current challenges in web crawling
ICWE'13: Proceedings of the 13th international conference on Web EngineeringWeb crawling, a process of collecting web pages in an automated manner, is the primary and ubiquitous operation used by a large number of web systems and agents starting from a simple program for website backup to a major web search engine. Due to an ...
Intelligent crawling of web applications for web archiving
WWW '12 Companion: Proceedings of the 21st International Conference on World Wide WebThe steady growth of the World Wide Web raises challenges regarding the preservation of meaningful Web data. Tools used currently by Web archivists blindly crawl and store Web pages found while crawling, disregarding the kind of Web site currently ...
Crawling the infinite web
Many publicly available Web pages are generated dynamically upon request, and contain links to other dynamically generated pages. Web sites that are built with dynamic pages can create, in principle, a very large amount of Web pages. This poses a ...
Comments