Sciweavers

WAW
2010
Springer
269views Algorithms» more  WAW 2010»
13 years 9 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 Pag...
Fan Chung, Wenbo Zhao
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 11 months ago
A General Framework for Graph Sparsification
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...
Ramesh Hariharan, Debmalya Panigrahi
ICALP
2009
Springer
14 years 11 months ago
Graph Sparsification in the Semi-streaming Model
Kook Jin Ahn, Sudipto Guha