Computing Personalized PageRank Quickly by Exploiting Graph Structures
Summary: Exploits core–tree decompositions of web and social graphs, separating an expander-like core from a small-treewidth remainder. An LU preconditioner for the latter accelerates GMRES-based exact PPR, requiring up to 7.5× fewer iterations and 5× less time than Power. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Takanori Maehara (National Institute of Informatics)
- 2. Takuya Akiba (University of Tokyo)
- 3. Yoichi Iwata (University of Tokyo)
- 4. Ken-ichi Kawarabayashi (National Institute of Informatics)
BibTeX Citation
@article{maehara_vldb14,
title = {{Computing Personalized PageRank Quickly by Exploiting Graph Structures}},
author = {Maehara, Takanori and Akiba, Takuya and Iwata, Yoichi and Kawarabayashi, Ken-ichi},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {12},
pages = {1023--1034},
doi = {10.14778/2732977.2732980},
url = {https://doi.org/10.14778/2732977.2732980},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 20 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00056944564 |
| 370 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019937972 |
| 556 | Fast Incremental and Personalized PageRank | 2011 | VLDB | 0.00016564032 |
| 1,116 | Large Graph Processing in the Cloud | 2010 | SIGMOD | 0.0001210972 |
| 1,414 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB | 0.00010848387 |
Previous
Page 1 / 1
Next