Parallelizing the Computation of PageRank

DOI10.1007/978-3-540-77004-6_17MaRDI QIDQ5458314zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Fast PageRank Computation via a Sparse Linear System
• Algorithms and Models for the Web-Graph
• On accelerating the PageRank computation
• An improved approach to the PageRank problems
• An inner-outer iteration for computing PageRank

Cited in

(8)

• An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
• A parallel pagerank algorithm for undirected graph
• Fast PageRank Computation via a Sparse Linear System
• 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
• On new PageRank computation methods using quantum computing
• Algorithms and Models for the Web-Graph

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)