Estimating PageRank on graph streams
From MaRDI portal
Publication:3016259
DOI10.1145/1970392.1970397zbMath1327.68032OpenAlexW2022994251MaRDI QIDQ3016259
Sreenivas Gollapudi, Atish Das Sarma, Rina Panigrahy
Publication date: 14 July 2011
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3159
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Random walks on graphs (05C81)
Related Items
An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC, Superlinear lower bounds for multipass graph processing, Local community detection in dynamic graphs using personalized centrality, Graph sketching and streaming: new approaches for analyzing massive graphs, Distributed PageRank computation with improved round complexities, Data mining of social networks represented as graphs, Intrinsic Graph Structure Estimation Using Graph Laplacian, Fast distributed PageRank computation, Active exploration for large graphs, Buyback Problem - Approximate Matroid Intersection with Cancellation Costs, Evolutionary Network Analysis, Unnamed Item, Multiplicative Approximations of Random Walk Transition Probabilities
