Local Computation of PageRank Contributions

DOI10.1080/15427951.2008.10129302zbMath1206.68346OpenAlexW3030647867MaRDI QIDQ3078596

John E. Hopcrofts, Reid Andersen, Vahab S. Mirrokni, Christian Borgs, Shang-Hua Teng, Jennifer T. Chayes

Publication date: 28 February 2011

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1259158596

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Internet topics (68M11)

Related Items

Can we locally compute sparse connected subgraphs?, Sublinear Algorithms for Local Graph-Centrality Estimation, Constructing near spanning trees with few local inspections, Unnamed Item, Local algorithms for sparse spanning graphs, Multiscale Matrix Sampling and Sublinear-Time PageRank Computation