Siddhartha Anand

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we address the problem of community detection in social networks. We present two maximum cost spanning tree-based community detection methods, namely P-SPAT and K-SPAT, for social networks. Communities are defined as dense subgraphs present in social networks. However, detecting communities in a social network can still be a challenging task,(More)
  • 1