J. Abello, M. G. Resende, and S. Sudarsky, Massive Quasi-Clique Detection, LATIN 2002: Theoretical Informatics, pp.598-612, 2002.
DOI : 10.1007/3-540-45995-2_51

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4659

M. Behrisch and A. Taraz, Efficiently covering complex networks with cliques of similar vertices, Theoretical Computer Science, vol.355, issue.1, pp.37-47, 2006.
DOI : 10.1016/j.tcs.2005.12.005

M. Blanchette, E. Kim, and A. Vetta, Clique Cover on Sparse Networks, 2012 Meeting on Algorithm Engineering & Experiments, 2012.
DOI : 10.1137/1.9781611972924.10

M. R. Garey and D. S. Johnson, Computers and Intractabilityd: A Guide to the Theory of NP-Completeness, 1979.

O. Kaya, E. Kayaaslan, B. Uçar, and I. S. Duff, On hypergraph-partitioning based fill reducing methods, 2013.

H. Matsuda, T. Ishihara, and A. Hashimoto, Classifying molecular sequences using a linkage graph with their pairwise similarities, Theoretical Computer Science, vol.210, issue.2, pp.305-325, 1999.
DOI : 10.1016/S0304-3975(98)00091-7

J. Pattillo, A. Veremyev, S. Butenko, and V. Boginski, On the maximum quasi-clique problem, Discrete Applied Mathematics, vol.161, issue.1-2, pp.244-257, 2013.
DOI : 10.1016/j.dam.2012.07.019

R. N°-8255 and R. Centre-grenoble-?-rhône-alpes, Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399