المستخلص: |
One of the most crucial fields that aids in understanding and analyzing the structure of huge and complex networks, such as social networks, collaborative networks, and web graphs, is communities’ detection. The significant elements of research is the extraction of pertinent information from these networks. The goal of community detection is to reduction the application-generated graph into smaller communities with comparable nodes. The counting of cliques in a larger network is a fundamental problem in graph theory. There is many algorithm used for detecting communities and find the cliques, the maximum clique algorithm. In this paper, a detailed survey of various methods applied for finding communities is given first. Then, the technique of clique , maximum clique and maximal clique is discussed and the main works that have been reported to detect social networks communities using these techniques is summarized
|