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

D. Eppstein, Small Maximal Independent Sets and Faster Exact Graph Coloring, Journal of Graph Algorithms and Applications, vol.7, issue.2, pp.131-140, 2003.
DOI : 10.7155/jgaa.00064

D. Eppstein, M. Löffler, and D. Strash, Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time, Proc. of 21st International Symposium on Algorithms and Computation, pp.403-41410, 2010.
DOI : 10.1007/978-3-642-17517-6_36

S. Gaspers, Exponential Time Algorithms: Structures, Measures, and Bounds, 2010.

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

E. L. Lawler, J. K. Lenstra, and A. H. Kan, Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms, SIAM Journal on Computing, vol.9, issue.3, pp.558-56510, 1980.
DOI : 10.1137/0209042

R. E. Miller and D. E. Muller, A problem of maximum consistent subsets, 1960.

J. W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1
DOI : 10.1007/BF02760024

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

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-51710, 1977.
DOI : 10.1137/0206036

V. Vatter, Maximal Independent Sets and Separating Covers, The American Mathematical Monthly, vol.118, issue.5, pp.418-423, 2011.
DOI : 10.4169/amer.math.monthly.118.05.418