• DOI:10.1016/j.tcs.2014.04.003
Corpus ID: 10284718

Fast distributed PageRank computation

@article{Sarma2015FastDP,
  title={Fast distributed PageRank computation},
  author={A. D. Sarma and A. R. Molla and Gopal Pandurangan and E. Upfal},
  journal={ArXiv},
  year={2015},
  volume={abs/1208.3071}
}

A. D. Sarma, A. R. Molla, +1 author E. Upfal

Published 2015

Computer Science

ArXiv

Over the last decade, PageRank has gained importance in a wide range of applications and domains, ever since it first proved to be effective in determining node importance in large graphs (and was a pioneering idea behind Google’s search engine). In distributed computing alone, PageRank vector, or more generally random walk based quantities have been used for several different applications ranging from determining important nodes, load balancing, search, and identifying connectivity structures… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed