The sequential clique percolation algorithm is method for detecting clique percolation communities. It is an alternative to CFinder: instead of finding maximal cliques in a graph and producing communities of all the possible clique sizes, the SCP algorithm finds all the cliques of single size and produces the community structure for all the possible thresholds. The SCP algorithm should work well even for large sparse networks, but might have trouble for dense networks and cliques of large size.