F. Amarger, J. Chanet, O. Haemmerlé, N. Hernandez, and C. Roussey, SKOS Sources Transformations for Ontology Engineering: Agronomical Taxonomy Use Case, MTSR 2014. CCIS, pp.314-328, 2014.
DOI : 10.1007/978-3-319-13674-5_29

F. Amarger, J. Chanet, O. Haemmerlé, N. Hernandez, and C. Roussey, Construction d'une ontologie par transformation de systèmes d'organisation des connaissances etévaluationetévaluation de la confiance, pp.37-61, 2015.
DOI : 10.3166/isi.20.3.37-61

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 and D. Strash, Listing all maximal cliques in large sparse real-world graphs, SEA 2011, pp.364-375, 2011.

E. Jiménez-ruiz, C. Grau, B. Aroyo, L. Welty, C. Alani et al., LogMap: Logic-Based and Scalable Ontology Matching, Part I. LNCS, pp.273-288, 2011.
DOI : 10.1007/11574620_45

S. Raunich, E. Rahm, P. Herrero, H. Panetto, R. Meersman et al., Towards a Benchmark for Ontology Merging, OTM-WS 2012, pp.124-133, 2012.
DOI : 10.1007/978-3-642-33618-8_20

C. Roussey, J. P. Chanet, V. Cellier, and F. Amarger, Agronomic taxon, Proceedings of the 2nd International Workshop on Open Data, WOD '13, p.5, 2013.
DOI : 10.1145/2500410.2500415
URL : https://hal.archives-ouvertes.fr/hal-00860828

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