| Crawling on web graphs |
| Full text |
Pdf
(221 KB)
|
| Source
|
Annual ACM Symposium on Theory of Computing
archive
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
table of contents
Montreal, Quebec, Canada
SESSION: Session 7B
table of contents
Pages: 419 - 427
Year of Publication: 2002
ISBN:1-58113-495-9
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 35, Citation Count: 4
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
|
| |
4
|
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+
|
| |
5
|
B. Bollobás, O. Riordan and J. Spencer, The degree sequence of a scale free random graph process, to appear.
|
| |
6
|
B. Bollobás and O. Riordan, The diameter of a scale free random graph, to appear.
|
| |
7
|
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
|
| |
8
|
|
| |
9
|
E. Drinea, M. Enachescu and M. Mitzenmacher, Variations on random graph models for the web.
|
| |
10
|
|
| |
11
|
W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13--30.
|
| |
12
|
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. The web as a graph. www.almaden.ibm.com+
|
| |
13
|
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. Stochastic models for the web graph. www.almaden.ibm.com+
|
| |
14
|
|
|