Capacity Releasing Diffusion for Speed and Locality.

no code implementations • ICML 2017 • Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao

As an application, we use our CRD Process to develop an improved local algorithm for graph clustering.

Clustering Graph Clustering

Capacity Releasing Diffusion for Speed and Locality

no code implementations • 19 Jun 2017 • Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao

Thus, our CRD Process is the first local graph clustering algorithm that is not subject to the well-known quadratic Cheeger barrier.

Clustering Graph Clustering