On accelerating the PageRank computation
From MaRDI portal
Publication:3071041
DOI10.1080/15427951.2009.10129182zbMATH Open1210.68130OpenAlexW2067616331MaRDI QIDQ3071041FDOQ3071041
Authors: Steve Osborne, Jorge Rebaza, Elizabeth Wiggins
Publication date: 31 January 2011
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1285339071
Recommendations
Cited In (23)
- Secure fast evaluation of iterative methods: with an application to secure PageRank
- Speeding up SimRank computations by polynomial preconditioners
- An improved approach to the PageRank problems
- PageRank computation with MAAOR and lumping methods
- Acceleration of an adaptive generalized Arnoldi method for computing PageRank
- Fast PageRank Computation via a Sparse Linear System
- Parallelizing the Computation of PageRank
- Aggregation/disaggregation as a theoretical tool
- A Survey on PageRank Computing
- An improved PageRank algorithm based on cloud computing
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Algorithms and Models for the Web-Graph
- On efficient randomized algorithms for finding the PageRank vector
- Bookmark-Coloring Algorithm for Personalized PageRank Computing
- Adaptive methods for the computation of PageRank
- Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
- Accelerating PageRank computations
- Efficient numerical methods to solve sparse linear equations with application to PageRank
- Practical acceleration for computing the HITS expertrank vectors
- Two accelerated non-backtracking PageRank algorithms for large-scale networks
- A preconditioning approach to the pagerank computation problem
- A Reordering for the PageRank Problem
- On new PageRank computation methods using quantum computing
This page was built for publication: On accelerating the PageRank computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3071041)