Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1708.05573
Cited By
Two provably consistent divide and conquer clustering algorithms for large networks
18 August 2017
Soumendu Sundar Mukherjee
Purnamrita Sarkar
Peter J. Bickel
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Two provably consistent divide and conquer clustering algorithms for large networks"
2 / 2 papers shown
Title
Graph sub-sampling for divide-and-conquer algorithms in large networks
Eric Yanchenko
55
1
0
11 Sep 2024
Covariate Regularized Community Detection in Sparse Graphs
Bowei Yan
Purnamrita Sarkar
72
55
0
10 Jul 2016
1