An adaptive bidirectional algorithm for constant-relative-error PageRank estimation is instance-optimal up to polylog factors on bounded-degree directed graphs and on sparse graphs with polylog high-degree vertices.
Chayes, John E
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Instance-Optimality in PageRank Computation
An adaptive bidirectional algorithm for constant-relative-error PageRank estimation is instance-optimal up to polylog factors on bounded-degree directed graphs and on sparse graphs with polylog high-degree vertices.