English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Algorithms and Experiments for the Webgraph

MPS-Authors
/persons/resource/persons44913

Leonardi,  Stefano
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45038

Meyer,  Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Donato, D., Laura, L., Leonardi, S., Millozzi, S., Meyer, U., & Sibeyn, J. F. (2006). Algorithms and Experiments for the Webgraph. Journal of Graph Algorithms and Applications, 10(2), 219-236.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-247E-3
Abstract
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.