Chapter

Algorithms and Models for the Web-Graph

Volume 3243 of the series Lecture Notes in Computer Science pp 118-130

Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)

  • Gianna M. Del CorsoAffiliated withDipartimento di Informatica, University of Pisa
  • , Antonio GullíAffiliated withDipartimento di Informatica, University of PisaIIT-CNR
  • , Francesco RomaniAffiliated withDipartimento di Informatica, University of Pisa

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The research community has devoted an increased attention to reduce the computation time needed by Web ranking algorithms. Many efforts have been devoted to improve PageRank [4, 23], the well known ranking algorithm used by Google. The core of PageRank exploits an iterative weight assignment of ranks to the Web pages, until a fixed point is reached. This fixed point turns out to be the (dominant) eigenpair of a matrix derived by the Web Graph itself.

Keywords

Link Analysis Search Engines Web Matrix Reducibility and Permutation