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. 1302.4549
  4. Cited By
Breaking the Small Cluster Barrier of Graph Clustering

Breaking the Small Cluster Barrier of Graph Clustering

19 February 2013
Nir Ailon
Yudong Chen
Huan Xu
ArXivPDFHTML

Papers citing "Breaking the Small Cluster Barrier of Graph Clustering"

6 / 6 papers shown
Title
Convex optimization for the densest subgraph and densest submatrix
  problems
Convex optimization for the densest subgraph and densest submatrix problems
Polina Bombina
Brendan P. W. Ames
39
9
0
05 Apr 2019
Clustering with Noisy Queries
Clustering with Noisy Queries
A. Mazumdar
B. Saha
31
95
0
22 Jun 2017
Graph sketching-based Space-efficient Data Clustering
Graph sketching-based Space-efficient Data Clustering
Anne Morvan
K. Choromanski
Cédric Gouy-Pailler
Jamal Atif
26
3
0
07 Mar 2017
Active Learning Algorithms for Graphical Model Selection
Active Learning Algorithms for Graphical Model Selection
Gautam Dasarathy
Aarti Singh
Maria-Florina Balcan
Jonghyuk Park
24
25
0
01 Feb 2016
Near-Optimal Joint Object Matching via Convex Relaxation
Near-Optimal Joint Object Matching via Convex Relaxation
Yuxin Chen
Leonidas J. Guibas
Qi-Xing Huang
39
141
0
06 Feb 2014
Improved Graph Clustering
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
94
191
0
11 Oct 2012
1