Fast pagerank computation via a sparse linear system

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

Volumn 3243, Issue , 2004, Pages 118-130

  Del Corso, Gianna M ^a   Gullí, Antonio ^a,b   Romani, Francesco ^a  

^a UNIVERSITY OF PISA   (Italy)

^b CNR   (Italy)

Author keywords

Link Analysis; Search Engines; Web Matrix Reducibility and Permutation

Indexed keywords

EID: 34247342778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30216-2_10     Document Type: Article

References (25)

1. A. Arasu, J. Novak, A. Tomkins, and J. Tomlin. PageRank computation and the structure of the Web: Experiments and algorithms. In Proc. of the 11th WWW Conf., 2002.
2. M. Bianchini, M. Gori, and F. Scarselli. Inside PageRank. ACM Trans, on Internet Technology, 2004. to appear.
3. P. Boldi and S. Vigna. WebGraph framework i: Compression techniques. In Proc. of the 23th Int. WWW Conf., 2004.
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. Z. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. L. Wiener:. Graph structure in the Web. Computer Networks, 33:309-320, 2000.
6. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In SODA, pages 859-860, 2000.
7. Y. Chen, Q. Gan, and T. Suel. I/o-efficient techniques for computing Pagerank. In Proc. of the 11th WWW Conf., 2002.
8. J. Cho and S. Roy. Impact of Web search engines on page popularity. In Proc. of the 13th WWW Conf., 2004.
9. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proc. 24th Nat. Conf. ACM, pages 157-172, 1969.
10. C. Douglas, J. Hu, M. Iskandarani, M. Kowarschik, U. Rüde, and C. Weiss. Maximizing cache memory usage for multigrid algorithms. In Multiphase Flows and Transport in Porous Media: State of the Art, pages 124-137. Springer, 2000.
11. N. Eiron, S. McCurley, and J. A. Tomlin. Ranking the web frontier. In Proc. of 13th WWW Conf., 2004.
12. G. H. Golub and C. F. Van Loan. Matrix Computations. The John Hopkins University Press, Baltimore, 1996. Third Edition.
13. T. Haveliwala. Efficient computation of PageRank. Technical report, Stanford University, 1999.
14. T. Haveliwala. Topic-sensitive PageRank. In Proc. of the 11th WWW Conf., 2002.
15. T. Haveliwala, S. Kamvar, and G. Jeh. An analytical comparison of approaches to personalizing PageRank. Technical report, Stanford University, 2003.
16. G. Jeh and J. Widom. Scaling personalized Web search. In Proc. of the 12th WWW Conf., 2002.
17. S. Kamvar and T. Haveliwala. The condition number of the pagerank problem. Technical report, Stanford University, 2003.
18. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Extrapolation methods for accelerating PageRank computations. In Proc. of 12th. WWW Conf., 2003.
19. S. D. Kamvar, T. H. Haveliwala, C. Manning, and G. H. Golub. Exploiting the block structure of the Web for computing PageRank. Technical report, Stanford University, 2003.
20. A. N. Langville and C. D. Meyer. Deeper inside PageRank. Internet Mathematics, 2004. to appear.
21. G. P. Lee, G. H. Golub, and S. A. Zenios. A fast two-stage algorithm for computing PageRank. Technical report, Stanford University, 2003.
22. K. Mehlhorn and U. Meyer. External-memory breadthfirst search with sublinear I/O. In European Symposium on Algorithms, pages 723-735, 2002.
23. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford, 1998.
24. W. S. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1995.
25. R. S. Varga. Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, 1962.