1 G. Iv´an, "When the web meets the cell : using personalized pagerank for analyzing protein interaction networks" 27 (27): 405-407, 2010
2 Mo, D., "Single-Source Personalized PageRanks with Workload Robustness" 2022
3 G. Jeh, "Scaling personalized web search" Acm 271-279, 2003
4 Liu, Q, "Powerwalk : Scalable personalized pagerank via random walks with vertex-centric decomposition" 195-204, 2016
5 L. Page, "PageRank citation ranking: Bringing order to the web" Stanford InfoLab 1999
6 K. Avrachenkov, "Monte carlo methods in pagerank computation : When one iteration is sufficient" 45 (45): 890-904, 2007
7 F. Pedroche, "Leadership groups on social network sites based on personalized pagerank" 57 (57): 1891-1896, 2013
8 S. Chakrabarti, "Index design and query processing for graph conductance search" 20 (20): 445-470, 2011
9 Yu, W., "IRWR : incremental random walk with restart" 1017-1020, 2013
10 P. A. Lofgren, "Fast-ppr : Scaling personalized pagerank estimation for large graphs" ACM 1436-1445, 2014
1 G. Iv´an, "When the web meets the cell : using personalized pagerank for analyzing protein interaction networks" 27 (27): 405-407, 2010
2 Mo, D., "Single-Source Personalized PageRanks with Workload Robustness" 2022
3 G. Jeh, "Scaling personalized web search" Acm 271-279, 2003
4 Liu, Q, "Powerwalk : Scalable personalized pagerank via random walks with vertex-centric decomposition" 195-204, 2016
5 L. Page, "PageRank citation ranking: Bringing order to the web" Stanford InfoLab 1999
6 K. Avrachenkov, "Monte carlo methods in pagerank computation : When one iteration is sufficient" 45 (45): 890-904, 2007
7 F. Pedroche, "Leadership groups on social network sites based on personalized pagerank" 57 (57): 1891-1896, 2013
8 S. Chakrabarti, "Index design and query processing for graph conductance search" 20 (20): 445-470, 2011
9 Yu, W., "IRWR : incremental random walk with restart" 1017-1020, 2013
10 P. A. Lofgren, "Fast-ppr : Scaling personalized pagerank estimation for large graphs" ACM 1436-1445, 2014
11 H. Tong, "Fast random walk with restart and its applications" IEEE 613-622, 2006
12 B. Bahmani, "Fast personalized pagerank on mapreduce" ACM 973-984, 2011
13 P. Sarkar, "Fast nearest-neighbor search in disk-resident graphs" ACM 513-522, 2010
14 Y. Fujiwara, "Fast and exact top-k search for random walk with restart" 5 (5): 442-453, 2012
15 Yoon, M, "Fast and accurate random walk with restart on dynamic graphs with guarantees" 409-418, 2018
16 Ohsaka, N, "Efficient pagerank tracking in evolving networks" 875-884, 2015
17 Yang, R., "Efficient and Effective Similarity Search over Bipartite Graphs" 308-318, 2022
18 T. Maehara, "Computing personalized pagerank quickly by exploiting graph structures" 7 (7): 1023-1034, 2014
19 P. Berkhin, "Bookmark-coloring algorithm for personalized pagerank computing" 3 (3): 41-62, 2006
20 K. Shin, "Bear : Block elimination approach for random walk with restart on large graphs" ACM 1571-1585, 2015