参考文献  G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435:814-818, 2005.  J. M. Kumpula, M. Kivelä, K. Kaski, and J. Saramäki. Sequential algorithm for fast clique percolation. Physical Review E, 78:026109, 2008.  E. Gregori, L. Lenzini, and S. Mainardi. Parallel k-clique community detection on large-scale networks. Parallel and Distributed Systems, IEEE Transactions on, PP:1, 2012.  F. Reid, A. McDaid, and N. Hurley. Percolation computation in complex networks. arXiv:1205.0038, 2012.  G. Palla, I. J. Farkas, P. Pollner, I. Derényi, and T. Vicsek. Directed network modules. New Journal of Physics, 9:186, 2007.  C. Bron and J. Kerbosch. Algorithm 457: ﬁnding all cliques of an undirected graph. Communications of the ACM, 16:575-577, 1973.  I. Koch. Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science, 250:1-30, 2001. K. Makino and T. Uno. New algorithms for enumerating all maximal cliques. Lecture Notes in Compute Science, 3111:260-272, 2004.