ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1708.05573
  4. Cited By
Two provably consistent divide and conquer clustering algorithms for
  large networks

Two provably consistent divide and conquer clustering algorithms for large networks

18 August 2017
Soumendu Sundar Mukherjee
Purnamrita Sarkar
Peter J. Bickel
ArXiv (abs)PDFHTML

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
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
Covariate Regularized Community Detection in Sparse Graphs
Bowei Yan
Purnamrita Sarkar
72
55
0
10 Jul 2016
1