Sublinear spectral clustering oracles achieve O(n^0.01) memory construction and sublinear query time for well-clusterable graphs, with a near-optimal S*T = O~(n) memory-time trade-off.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sublinear Spectral Clustering Oracle with Little Memory
Sublinear spectral clustering oracles achieve O(n^0.01) memory construction and sublinear query time for well-clusterable graphs, with a near-optimal S*T = O~(n) memory-time trade-off.