A critical Comparison of Graph Clustering Algorithms Using the K-clique Percolation Technique

@inproceedings{Dhara2012ACC,
  title={A critical Comparison of Graph Clustering Algorithms Using the K-clique Percolation Technique},
  author={Mousumi Dhara and K. K. Shukla and Neeraj Sharma},
  year={2012}
}
In the recent past, various graph clustering algorithms have been proposed. Each algorithm has its own behaviour in terms of performance on a specific data set. So, it is really hard to tell which one is the most efficient and optimal. The concept of k-clique percolation technique in random networks is introduced where k is the size of the complete sub… CONTINUE READING