N. Bansal, A. Blum, and S. Chawla, Correlation clustering, Machine Learning, pp.89-113, 2004.

J. R. Blair and B. Peyton, An introduction to chordal graphs and clique trees In: Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications, pp.1-29, 1993.

S. Böcker and P. Damaschke, Even faster parameterized cluster deletion and cluster editing, Information Processing Letters, vol.111, issue.14, pp.717-721, 2011.
DOI : 10.1016/j.ipl.2011.05.003

M. Charikar, V. Guruswami, and A. Wirth, Clustering with qualitative information, Proc. of 44th Annu. IEEE Symp. Foundations of Computer Science, FOCS 2003, pp.524-533

E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica, Correlation clustering in general weighted graphs, Theoretical Computer Science, vol.361, issue.2-3, pp.172-187, 2006.
DOI : 10.1016/j.tcs.2006.05.008

A. Dessmark, A. Lingas, E. M. Lundell, M. Persson, and J. Jansson, ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS, International Journal of Foundations of Computer Science, vol.18, issue.02, pp.217-226, 2007.
DOI : 10.1142/S0129054107004656

J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.69, issue.1 and 2, pp.125-130, 1965.
DOI : 10.6028/jres.069B.013

S. Földes and P. L. Hammer, Split graphs, Proc. of 8th South-Eastern Conference on Combinatorics , Graph Theory and Computing, pp.311-315, 1977.

Y. Gao, D. R. Hare, and J. Nastos, The cluster deletion problem for cographs, Discrete Mathematics, vol.313, issue.23, pp.2763-2771, 2013.
DOI : 10.1016/j.disc.2013.08.017

P. Hansen and B. Jaumard, Cluster analysis and mathematical programming, Mathematical Programming, vol.15, issue.2, pp.191-215, 1997.
DOI : 10.1007/BF02614317

J. Hartigan, Classification and Clustering, Journal of Marketing Research, vol.18, issue.4, 1975.
DOI : 10.2307/3151350

S. Iwata, L. Fleischer, and S. Fujishige, A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the ACM, vol.48, issue.4, pp.761-777, 2001.
DOI : 10.1145/502090.502096

C. Komusiewicz and J. Uhlmann, Cluster editing with locally bounded modifications, Discrete Applied Mathematics, vol.160, issue.15, pp.2259-2270, 2012.
DOI : 10.1016/j.dam.2012.05.019

F. S. Roberts, Indifference graphs, Proof Techniques in Graph Theory (F. Harary, pp.139-146, 1969.

A. Schrijver, A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time, Journal of Combinatorial Theory, Series B, vol.80, issue.2, pp.346-355, 2000.
DOI : 10.1006/jctb.2000.1989

R. Shamir, R. Sharan, and D. Tsur, Cluster graph modification problems, Discrete Applied Mathematics, vol.144, issue.1-2, pp.173-182, 2004.
DOI : 10.1016/j.dam.2004.01.007
URL : http://doi.org/10.1016/j.dam.2004.01.007