2013 (modified: 13 May 2025)ICML (3) 2013Readers: Everyone
Abstract:Motivated by applications of large-scale graph clustering, we study random-walk-based LOCAL algorithms whose running times depend only on the size of the output cluster, rather than the entire grap...