Jiakai Xiao

Learn More
Traditional graph clustering methods perform poorly on real world power-law graphs out of core. To tackle this challenge, in this paper, we propose an algorithm to cluster such large power law graphs in case of small memory size. In the proposed method, clusters (connected components) are formed by removing top degree nodes (hubs) from the graph. In order(More)
  • 1