K. Nesreen, J. Ahmed, R. A. Neville, N. G. Rossi, and . Duffield, Efficient graphlet counting for large networks, 2015 IEEE International Conference on Data Mining, ICDM 2015, pp.1-10, 2015.

A. Akkoyunlu, The Enumeration of Maximal Cliques of Large Graphs, SIAM Journal on Computing, vol.2, issue.1, pp.1-6, 1973.
DOI : 10.1137/0202001

R. Alon, U. Yuster, and . Zwick, Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995.
DOI : 10.1145/210332.210337

D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, vol.65, issue.1-3, pp.21-46, 1996.
DOI : 10.1016/0166-218X(95)00026-N

E. Bierstone, Cliques and generalized cliques in a finite linear graph, 1960.

A. Björklund, R. Pagh, V. V. Williams, and U. Zwick, Listing Triangles, Automata, Languages, and Programming ? 41st International Colloquium, ICALP 2014, Proceedings, Part I, pp.223-234, 2014.
DOI : 10.1007/978-3-662-43948-7_19

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-576, 1973.
DOI : 10.1145/362342.362367

F. Cazals and C. Karande, A note on the problem of reporting maximal cliques, Theoretical Computer Science, vol.407, issue.1-3, pp.564-568, 2008.
DOI : 10.1016/j.tcs.2008.05.010

J. X. Chang, L. Yu, and . Qin, Fast Maximal Cliques Enumeration in Sparse Graphs, Algorithmica, vol.6, issue.3, pp.173-186, 2013.
DOI : 10.1007/s00453-012-9632-8

J. Cheng, L. Zhu, Y. Ke, and S. Chu, Fast algorithms for maximal clique enumeration with limited memory, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pp.1240-1248, 2012.
DOI : 10.1145/2339530.2339724

N. Chiba and T. Nishizeki, Arboricity and Subgraph Listing Algorithms, SIAM Journal on Computing, vol.14, issue.1, pp.210-223, 1985.
DOI : 10.1137/0214017

C. Comin and R. Rizzi, An improved upper bound on maximal clique listing via rectangular fast matrix multiplication

A. Conte, R. D. Virgilio, A. Maccioni, M. Patrignani, and R. Torlone, Finding all maximal cliques in very large social networks, Proceedings of I C A L

N. Du, B. Wu, L. Xu, B. Wang, and P. Xin, Parallel Algorithm for Enumerating Maximal Cliques in Complex Network, Mining Complex Data, pp.207-221, 2009.
DOI : 10.1007/978-3-540-88067-7_12

D. Eppstein, M. Löffler, and D. Strash, Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time, pp.403-414, 2010.
DOI : 10.1007/978-3-642-17517-6_36

D. Eppstein, M. Löffler, and D. Strash, Listing all maximal cliques in large sparse real-world graphs, ACM Journal of Experimental Algorithmics, 2013.

K. Fukuda, Note on new complexity classes ENP, EP and CEP. https://www.inf. ethz.ch/personal, pp.2016-2018, 1996.

L. Gerhards and W. Lindenberg, Cliquenbestimmung in ungerichteten Graphen: Zwei neue Algorithmen, Computing, vol.3, issue.4, pp.295-322, 1979.
DOI : 10.1007/BF02248731

N. Eo and . Gilbert, Enumeration of labelled graphs, Canad. J. Math, vol.8, issue.1, pp.5-411, 1956.

A. Gély, L. Nourine, and B. Sadi, Enumeration aspects of maximal cliques and bicliques, Discrete Applied Mathematics, vol.157, issue.7, pp.1447-1459, 2009.
DOI : 10.1016/j.dam.2008.10.010

J. Christopher, S. Henry, and . Ramanna, Transactions on Rough Sets XVI, chapter Maximal Clique Enumeration in Finding Near Neighbourhoods, pp.103-124, 2013.

A. Itai and M. Rodeh, Finding a Minimum Circuit in a Graph, SIAM Journal on Computing, vol.7, issue.4, pp.413-423, 1978.
DOI : 10.1137/0207033

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-12390065, 1988.
DOI : 10.1016/0020-0190(88)90065-8

C. Johnston, Cliques of a graph-variations on the Bron-Kerbosch algorithm, International Journal of Computer & Information Sciences, vol.2, issue.3, pp.209-238, 1976.
DOI : 10.1007/BF00991836

K. Makino and T. Uno, New Algorithms for Enumerating All Maximal Cliques, Algorithm Theory-SWAT 2004, pp.260-272, 2004.
DOI : 10.1007/978-3-540-27810-8_23

S. Milo, S. Shen-orr, N. Itzkovitz, D. Kashtan, U. Chklovskii et al., Network Motifs: Simple Building Blocks of Complex Networks, Science, vol.298, issue.5594, pp.824-827, 2002.
DOI : 10.1126/science.298.5594.824

W. John, L. Moon, and . Moser, On cliques in graphs, Israel journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.

D. Gordon, D. G. Mulligan, and . Corneil, Corrections to Bierstone's algorithm for generating cliques, J. ACM, vol.19, issue.2, pp.244-247, 1972.

L. Pan and E. E. Santos, An anytime-anywhere approach for maximal clique enumeration in social network analysis, 2008 IEEE International Conference on Systems, Man and Cybernetics, pp.3529-3535, 2003.
DOI : 10.1109/ICSMC.2008.4811845

T. Schank and D. Wagner, Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study, Experimental and Efficient Algorithms, 4th InternationalWorkshop , WEA 2005, Proceedings, pp.606-609, 2005.
DOI : 10.1007/11427186_54

C. Matthew, N. F. Schmidt, K. Samatova, B. Thomas, and . Park, A scalable , parallel algorithm for maximal clique enumeration, Journal of Parallel and Distributed Computing, vol.69, issue.4, pp.417-428, 2009.

S. Shervashidze, T. Vishwanathan, K. Petri, K. M. Mehlhorn, and . Borgwardt, Efficient graphlet kernels for large graph comparison, Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics JMLR Proceedings, pp.488-495, 2009.

E. Tomita, A. Tanaka, and H. Takahashi, The worst-case time complexity for generating all maximal cliques and computational experiments, Theoretical Computer Science, vol.363, issue.1, pp.28-42, 2006.
DOI : 10.1016/j.tcs.2006.06.015

H. M. Trent, A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH, Proceedings of the National Academy of Sciences, pp.1004-1007, 1954.
DOI : 10.1073/pnas.40.10.1004

S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa, A New Algorithm for Generating All the Maximal Independent Sets, SIAM Journal on Computing, vol.6, issue.3, pp.505-517, 1977.
DOI : 10.1137/0206036

T. Uno, Two general methods to reduce delay and change of enumeration algorithms, National Institute of Informatics, vol.4, 2003.

T. Uno, An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem, Algorithmica, vol.6, issue.7043, pp.3-16, 2008.
DOI : 10.1007/s00453-008-9238-3

G. Leslie and . Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979.

H. 40-kunihiro-wasa, T. Arimura, and . Uno, Efficient enumeration of induced subtrees in a k-degenerate graph, Algorithms and Computation: 25th International Symposium, ISAAC 2014, Proceedings, pp.94-102, 2014.

Y. Xu, J. Cheng, A. Wai-chee, Y. Fu, and . Bu, Distributed Maximal Clique Computation, 2014 IEEE International Congress on Big Data, pp.160-167, 2014.
DOI : 10.1109/BigData.Congress.2014.31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.6420