Publisher
Springer Nature Singapore
Reference38 articles.
1. Barnes, G., Feige, U.: Short random walks on graphs. In: STOC, pp. 728–737. ACM (1993)
2. Brakensiek, J., Guruswami, V.: Bridging between 0/1 and linear programming via random walks. In: STOC, pp. 568–577. ACM (2019)
3. Chan, T.H., Guerquin, A., Hu, S., Sozio, M.: Fully dynamic k-center clustering with improved memory efficiency. IEEE Trans. Knowl. Data Eng. 34(7), 3255–3266 (2022)
4. Chen, X., Cai, D.: Large scale spectral clustering with landmark-based representation. In: AAAI. AAAI Press (2011)
5. Cheng, Y.: Mean shift, mode seeking, and clustering. IEEE Trans. Pattern Anal. Mach. Intell. 17(8), 790–799 (1995)