SIGN IN
SIGN UP
Estimating PageRank on graph streams
Full Text:
PDF
Buy this Article
Authors:
Atish Das Sarma
Georgia Tech, Atlanta, GA, USA
Sreenivas Gollapudi
Microsoft Research, Mountain View, CA, USA
Rina Panigrahy
Microsoft Research, Mountain View, CA, USA
Published in:
· Proceeding
PODS '08
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 69-78
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-60558-152-1
doi>
10.1145/1376916.1376928
2008 Article
Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 72
· Downloads (cumulative): 511
· Citation Count: 14
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
graph conductance
mixing time
pagerank
performance
random walk
streaming algorithms
theory
tradeoffs among complexity measures
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder