Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

IICS
2005
Springer

favoriteEmaildiscussreport

81views Internet Technology» more IICS 2005»

Distributed Calculation of PageRank Using Strongly Connected Components

13 years 10 months ago

Distributed Calculation of PageRank Using Strongly Connected Components

Download www.tu-ilmenau.de

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 signiﬁcantly small subproblems.

Michael Brinkmeier

Real-time Traffic

Global Ranking | IICS 2005 | Ranking | Strongly Connected Components |

claim paper

Related Content

» Computing Bridges Articulations and 2Connected Components in Wireless Sensor Networks

» Parallelization of DQMC simulation for strongly correlated electron systems

» Better speedups using simpler parallel programming for graph connectivity and biconnectivi...

» Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods

» Web Services separation of concerns computation coordination communication

» Stochastic Reasoning About ChannelBased Component Connectors

» A study of link farm distribution and evolution using a time series of web snapshots

» Probabilistic Analysis of Large Finite State Machines

» Analysis Tool for Diffusion Tensor MRI

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	IICS
Authors	Michael Brinkmeier

Comments (0)