Parallelizing the Computation of PageRank
From MaRDI portal
Publication:5458314
DOI10.1007/978-3-540-77004-6_17zbMATH Open1136.68340OpenAlexW2163580370MaRDI QIDQ5458314FDOQ5458314
Authors: John Wicks, Amy Greenwald
Publication date: 11 April 2008
Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77004-6_17
Recommendations
Cited In (8)
- An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
- Fast PageRank Computation via a Sparse Linear System
- Algorithms and Models for the Web-Graph
- Towards an FPGA solver for the PageRank eigenvector problem
- Multi-scale metastable dynamics and the asymptotic stationary distribution of perturbed Markov chains
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- A parallel pagerank algorithm for undirected graph
- On new PageRank computation methods using quantum computing
This page was built for publication: Parallelizing the Computation of PageRank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458314)