Description: k-clique algorithm as defined in the paper "Uncovering the overlapping community structure of complex networks in nature and society"- G. Palla, I. Derényi, I. Farkas, and T. Vicsek- Nature 435, 814–818 (2005)
[X,Y,Z] = k_clique(k,A)
Inputs:
k- clique size
A- adjacency matrix
Outputs:
X- detected communities
Y- all cliques (i.e. complete subgraphs that are not parts of larger complete subgraphs)
Z- k-clique matrix
To Search:
File list (Check if you may need any files):
k_clique.m
license.txt
Download