153
Voted
WAW
2010
Springer
14 years 10 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
110
Voted
CORR
2010
Springer
15 years 11 days ago
2010
Springer
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
78
Voted
ICALP
2009
Springer
16 years 16 days ago
2009
Springer
