Algorithms and experiments for the webgraph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 703-714

  Laura, Luigi ^a   Leonardi, Stefano ^a   Millozzi, Stefano ^a   Meyer, Ulrich ^b   Sibeyn, Jop F ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; GRAPHIC METHODS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

ALGORITHMIC TOOLS; COMPUTING PROPERTIES; LARGE SCALE SIMULATIONS; MASSIVE GRAPH; STOCHASTIC GRAPHS; SYNTHETIC GRAPHS; TOPOLOGICAL PROPERTIES; WEB GRAPHS;

TOPOLOGY;

EID: 0142214893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_63     Document Type: Article

References (19)

1. R. Albert, H. Jeong, and A.L. Barabasi. Nature, (401):130, 1999.
2. O. Riordan B. Bollobas. Robustness and ulnerability of scale-free random graphs. Internet Mathematics, 1(1):1-35, 2003.
3. A.L. Barabasi and A. Albert. Emergence of scaling in random networks. Science, (286):509, 1999.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
5. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, S. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. In Proceedings of the 9th WWW conference, 2000.
6. C. Cooper and A. Frieze. A general model of undirected web graphs. In Proc. of the 9th Annual European Symposium on Algorithms(ESA).
7. P. Erdös and Renyi R. Publ. Math. Inst. Hung. Acad. Sci, 5, 1960.
8. T. H. Haveliwala. Efficient computation of pagerank. Technical report, Stanford University, 1999.
9. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1997.
10. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In Proc. of 41st FOCS, pages 57-65, 2000.
11. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber communities. In Proc. of the 8th WWW Conference, pages 403-416, 1999.
12. L. Laura, S. Leonardi, G. Caldarelli, and P. De Los Rios. A multi-layer model for the webgraph. In On-line proceedings of the 2nd International Workshop on Web Dynamics., 2002.
13. L. Laura, S. Leonardi, and S. Millozzi. A software library for generating and measuring massive webgraphs. Technical Report 05-03, DIS - University of Rome La Sapienza, 2003.
14. M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Internet Mathematics, 1(2), 2003.
15. G. Pandurangan, P. Raghavan, and E. Upfal. Using pagerank to characterize web structure. In Springer-Verlag, editor, Proc. of the 8th Annual International Conference on Combinatorics and Computing (COCOON), LNCS 2387, pages 330-339, 2002.
16. D.M. Pennock, G.W. Flake, S. Lawrence, E.J. Glover, and C.L. Giles. Winners don't take all: Characterizing the competition for links on the web. Proc. of the National Academy of Sciences, 99(8):5207-5211, April 2002.
17. J.F. Sibeyn, J. Abello, and U. Meyer. Heuristics for semi-external depth first search on directed graphs. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (SPAA), pages 282-292, 2002.
18. J. Vitter. External memory algorithms. In Proceedings of the 6th Annual European Symposium, on Algorithms, volume 1461 of Lecture Notes in Computer Science, pages 1-25. Springer, 1998.
19. The Stanford webbase project. http://www-diglib.stanford.edu/~testbed/ doc2/WebBase/.