J. , G. Augustson, and J. Minker, An analysis of some graph theoretical cluster techniques, Journal of the ACM (JACM), vol.17, issue.4, pp.571-588, 1970.

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, 1973.

P. Mac-carron and R. I. Dunbar, Identifying natural grouping structure in gelada baboons: a network approach, Animal Behaviour, vol.114, pp.119-128, 2016.

D. Eppstein and D. Strash, Listing all maximal cliques in large sparse real-world graphs, Experimental Algorithms, pp.364-375, 2011.

J. Fournet and A. Barrat, Contact patterns among high school students, PLoS ONE, vol.9, p.107878, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01065922

A. Himmel, H. Molter, R. Niedermeier, and M. Sorge, Enumerating maximal cliques in temporal graphs, Advances in Social Networks Analysis and Mining (ASONAM), pp.337-344, 2016.

A. Himmel, H. Molter, R. Niedermeier, and M. Sorge, Adapting the bron-kerbosch algorithm for enumerating maximal cliques in temporal graphs, Social Network Analysis and Mining, vol.7, p.16, 2017.

L. Isella, J. Stehlé, A. Barrat, C. Cattuto, J. Pinton et al., What's in a crowd? analysis of face-to-face behavioral networks, Journal of Theoretical Biology, vol.271, issue.1, pp.166-180, 2011.

. Konect and . Dnc, , 2017.

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, pp.28-42, 2006.

T. Viard, R. Fournier-s'niehotta, C. Magnien, and M. Latapy, Discovering patterns of interest in IP traffic using cliques in bipartite link streams, Proceedings of the International Conference on Complex Networks(CompleNet), 2018.
URL : https://hal.archives-ouvertes.fr/hal-01665089

T. Viard, M. Latapy, and C. Magnien, Computing maximal cliques in link streams, Theor. Comput. Sci, vol.609, pp.245-252, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01112627

T. Viard and C. Magnien, Source code in python for our algorithm, 2017.