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.
[WW23] Hanzhi Wang and Zhewei Wei
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
DMICF models interactions from user- and item-centric perspectives with a macro-micro prototype-aware variational encoder and dimension-wise intent alignment to improve collaborative filtering.
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.
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
-
Dual-Perspective Disentangled Multi-Intent Alignment for Enhanced Collaborative Filtering
DMICF models interactions from user- and item-centric perspectives with a macro-micro prototype-aware variational encoder and dimension-wise intent alignment to improve collaborative filtering.