Algorithms and Experiments for the Webgraph
Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn · Journal of Graph Algorithms and Applications · 2006
In this paper we present an experimental study of the statistical and topological properties of the Webgraph. This work has required the development of a set of external and semi-external algorithms for computing properties of massive graphs, and for the large scale simulation of stochastic graph models. We use these algorithms for running experiments on a large crawl from 2001 of 200M pages and about 1.4 billion edges made available by theWebBase project at Stanford [19], and on synthetic graphs obtained by the large scale simulation of stochastic graph models for the Webgraph.