Fast PageRank computation via a sparse linear system (extended abstract)
From MaRDI portal
Recommendations
Cited in
(18)- Off-diagonal low-rank preconditioner for difficult PageRank problems
- Fast computation of stationary joint probability distribution of sparse Markov chains
- An efficient elimination strategy for solving PageRank problems
- PageRank computation with MAAOR and lumping methods
- Deterministic coresets for stochastic matrices with applications to scalable sparse PageRank
- The PageRank model of minimal irreducible adjustment and its lumping method
- On accelerating the PageRank computation
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Traps and Pitfalls of Topic-Biased PageRank
- Towards an FPGA solver for the PageRank eigenvector problem
- An improved computation of the PageRank algorithm
- A note on certain ergodicity coefficients
- Efficient numerical methods to solve sparse linear equations with application to PageRank
- Parallelizing the Computation of PageRank
- A Reordering for the PageRank Problem
- Fast PageRank Computation via a Sparse Linear System
- scientific article; zbMATH DE number 2242727 (Why is no real title available?)
- Secure fast evaluation of iterative methods: with an application to secure PageRank
This page was built for publication: Fast PageRank computation via a sparse linear system (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311164)