Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Numerical Analysis×1Stats ML×1
Frequent co-authors
Research Timeline
2026
Scalable Graph Coreset Selection via Greedy Sampling
A new graph sampling algorithm based on minimum inner product greedy selection rule is proposed, which requires only access to a small random subset of Laplacian columns and achieves sampling proportional to cluster size under the stochastic block model.
Highlighted terms show continued research focus across papers