Estimating PageRank on graph streams
J. ACM, ArticleNo.13, 2011.
smaller numberapproximate PageRank valuenodes nPageRank padditive errorMore(7+)
This study focuses on computations on large graphs (e.g., the web-graph) where the edges of the graph are presented as a stream. The objective in the streaming model is to use small amount of memory (preferably sub-linear in the number of nodes n) and a few passes. In the streaming model, we show how to perform several graph computations ...More
Full Text (Upload PDF)