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

O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.444-451, 1988.
DOI : 10.1109/SFCS.1988.21960

H. Saran and V. V. Vazirani, Cuts within Twice the Optimal, SIAM Journal on Computing, vol.24, issue.1, pp.101-108, 1995.
DOI : 10.1137/S0097539792251730

R. G. Downey, V. Estivill-castro, M. R. Fellows, E. Prieto, and F. A. , Cutting Up Is Hard To Do, Electronic Notes in Theoretical Computer Science, vol.78, issue.0, pp.209-222, 2003.
DOI : 10.1016/S1571-0661(04)81014-4

M. Hansen and P. Delattre, Complete-Link Cluster Analysis by Graph Coloring, Journal of the American Statistical Association, vol.20, issue.362, pp.397-403, 1978.
DOI : 10.1080/01621459.1969.10500990

S. B. Patkar and H. Narayanan, An efficient practical heuristic for good ratiocut partitioning, Proceedings of the 16th International Conference on VLSI Design, pp.64-69, 2003.

T. Gonzalez, On the computational complexity of clustering and related problems, pp.174-182, 1982.
DOI : 10.1007/BFb0006133

M. Koivisto and O. An, An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.583-590, 2006.
DOI : 10.1109/FOCS.2006.11

T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of graph partition problems, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.464-472, 1999.
DOI : 10.1145/301250.301373

N. Vikas, Computational Complexity of Compaction to Reflexive Cycles, SIAM Journal on Computing, vol.32, issue.1, pp.253-280, 2002.
DOI : 10.1137/S0097539701383522

N. Vikas, Computational Complexity Classification of Partition under Compaction and Retraction, Proceedings of the 10th international Computing and Combinatorics Conference, pp.380-391, 2004.
DOI : 10.1007/978-3-540-27798-9_41

N. Vikas, A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results, Journal of Computer and System Sciences, vol.71, issue.4, pp.406-439, 2005.
DOI : 10.1016/j.jcss.2004.07.003

N. Vikas, Algorithms for Partition of Some Class of Graphs under Compaction, Proceedings of the 17th international Computing and Combinatorics Conference, pp.319-330, 2011.
DOI : 10.1007/978-3-642-22685-4_29

J. Håstad, Clique is hard to approximate within n 1?, Proceedings of the 37th annual symposium on Foundations Of Computer Science, pp.627-636, 1996.

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.1-6, 1987.
DOI : 10.1145/28395.28396

URL : http://doi.org/10.1016/s0747-7171(08)80013-2

J. Nesetril and S. Poljak, on the complexity of the subgraph problem, Commentationes Mathematicae Universitatis Carolinae, vol.26, pp.415-419, 1985.

R. Watrigant, M. Bougeret, and R. Giroudeau, The k-sparsest subgraph problem, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00735713