COS is a free, opensource, parallel k-clique community detection method. Its name is the acronym of CPM On Steroids, in honour of the Clique Percolation Method (CPM), which was the first method for detecting k-clique communities.

In short, COS expects as input the list of maximal cliques of a graph and delivers as output k-clique communities for each possible size k.

If you do not know how to obtain the list of the maximal cliques of your graph, you might want to have a look at the page [MaximalCliquesListing].

If you are intending to use COS, please cite our work:
Enrico Gregori, Luciano Lenzini, Simone Mainardi, "Parallel k-Clique Community Detection on Large-Scale Networks," IEEE Transactions on Parallel and Distributed Systems

Documentation

• [SetupAndCompile]
• [UserGuide]
• [FAQ]