Sciweavers

Share
WAW
2010
Springer

A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification

8 years 11 months ago
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification
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 PageRank algorithm is crucial for computing a quantitative ranking of edges in a given graph. We will use the edge ranking to examine two interrelated problems
Fan Chung, Wenbo Zhao
Added 15 Feb 2011
Updated 15 Feb 2011
Type Journal
Year 2010
Where WAW
Authors Fan Chung, Wenbo Zhao
Comments (0)
books