Accelerating PageRank computations

MaRDI QIDQ5500844zbMATH OpenFDO

Authors Sławomir T. Wierzchoń, Mieczysław Kłopotek, Dariusz Czerski, Michał Dramiński, Krzysztof Chris Ciesielski

Publication date 10 August 2015

zbMATH Keywords

Monte CarloPageRankpower methodJacobi iterations

Mathematics Subject Classification ID

Internet topics (68M11)

Recommendations

• On accelerating the PageRank computation
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector
• Adaptive methods for the computation of PageRank

Cited in

(10)

• An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
• Network Capacity Bound for Personalized PageRank in Multimodal Networks
• On accelerating the PageRank computation
• An improved PageRank algorithm based on cloud computing
• A Survey on PageRank Computing
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Adaptive methods for the computation of PageRank
• scientific article; zbMATH DE number 2242727 (Why is no real title available?)
• Practical acceleration for computing the HITS expertrank vectors
• On new PageRank computation methods using quantum computing

This page was built for publication: Accelerating PageRank computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500844)