Establishes near-optimal time bounds for SSPPR-A and SSPPR-R queries, with matching upper and lower bounds for SSPPR-R on graphs where m is Omega(n log squared n).
Scara: scalable graph neural networks with feature-oriented optimization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
FeLoG achieves 27.9x average speedup and over 53% communication reduction in distributed graph embedding by using feedback-coupled sampling, activity-aware communication, and round-interleaved pipelining.
citing papers explorer
-
Near-Optimality for Single-Source Personalized PageRank
Establishes near-optimal time bounds for SSPPR-A and SSPPR-R queries, with matching upper and lower bounds for SSPPR-R on graphs where m is Omega(n log squared n).