Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
2021pp. 1996–2008
Citations Over TimeTop 10% of 2021 papers
Abstract
Personalized PageRank (PPR) is a critical measure of the importance of a node t to a source node s in a graph. The Single-Source PPR (SSPPR) query computes the PPR's of all the nodes with respect to s on a directed graph G with n nodes and m edges; and it is an essential operation widely used in graph applications. In this paper, we propose novel algorithms for answering two variants of SSPPR queries: (i) high-precision queries and (ii) approximate queries.
Related Papers
- → A Power–Arnoldi algorithm for computing PageRank(2007)64 cited
- → A two-step matrix splitting iteration for computing PageRank(2014)50 cited
- → A note on the two-step matrix splitting iteration for computing PageRank(2016)31 cited
- PageRank algorithm optimization and improvement(2009)
- A modified power method for the PageRank problem(2009)