Distributed Calculation of PageRank Using Strongly Connected Components

We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated componentwise, as long as the rankings of pages directly linking to the current component are already known. Depending on the structure of the WWW, this approach approach may be used to calculate the ranking on several components in parallel, and allows to split the problem intio significantly small subproblems.

• Type: Conference
• Year: 2005
• Where: IICS
• Authors: Michael Brinkmeier
• Keywords: Global Ranking, IICS 2005, Ranking, Strongly Connected Components