H. Bunke, P. Dickinson, M. Kraetzl, M. Neuhaus, and M. Stettler, Matching of Hypergraphs ??? Algorithms, Applications, and Experiments, In: Applied Pattern Recognition, pp.131-154, 2008.
DOI : 10.1007/978-3-540-76831-9_6

M. Grötschel, L. Lovász, and A. Schrijver, Stable sets in graphs In: Geometric Algorithms and Combinatorial Optimization, pp.272-303, 1993.

D. Gusfield, Partition-distance: A problem and class of perfect graphs arising in clustering, Information Processing Letters, vol.82, issue.3, pp.159-164, 2002.
DOI : 10.1016/S0020-0190(01)00263-0

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics, vol.2, issue.3, pp.253-267, 1972.
DOI : 10.1016/0012-365X(72)90006-4

M. Meil?-a, Comparing clusterings by the variation of information In: Learning theory and kernel machines, pp.173-187, 2003.

D. C. Porumbel, J. K. Hao, and P. Kuntz, An efficient algorithm for computing the distance between close partitions, Discrete Applied Mathematics, vol.159, issue.1, pp.53-59, 2011.
DOI : 10.1016/j.dam.2010.09.002
URL : https://hal.archives-ouvertes.fr/hal-00567981

F. Queyroi, M. Delest, J. Fédou, and G. Melançon, Assessing the quality of multilevel graph clustering, Data Mining and Knowledge Discovery, vol.35, issue.2, pp.1107-1128, 2014.
DOI : 10.1007/s10618-013-0335-9
URL : https://hal.archives-ouvertes.fr/hal-00579474

D. Robinson and L. R. Foulds, Comparison of phylogenetic trees, Mathematical Biosciences, vol.53, issue.1-2, pp.131-147, 1981.
DOI : 10.1016/0025-5564(81)90043-2

S. I. Sheikh, T. Y. Berger-wolf, A. A. Khokhar, I. C. Caballero, M. V. Ashley et al., COMBINATORIAL RECONSTRUCTION OF HALF-SIBLING GROUPS FROM MICROSATELLITE DATA, Journal of Bioinformatics and Computational Biology, vol.08, issue.02, pp.337-356, 2010.
DOI : 10.1142/S0219720010004793