D. Allouche, Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP, Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, pp.12-29, 2015.
DOI : 10.1007/978-3-319-23219-5_2
URL : https://hal.archives-ouvertes.fr/hal-01198361

B. Andrew and . Baker, The hazards of fancy backtracking, In: AAAI, vol.94, p.288, 1994.

R. [. Barrow and . Burstall, Subgraph isomorphism, matching relational structures and maximal cliques, Information Processing Letters, vol.4, issue.4, pp.83-84, 1976.
DOI : 10.1016/0020-0190(76)90049-1

[. Beldiceanu, An O (nlog n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization, In: ECAI, vol.12, pp.145-150, 2012.

C. Berge, Graphes et hypergraphes, 1973.

[. Bessière, An optimal coarse-grained arc consistency algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2005.
DOI : 10.1016/j.artint.2005.02.004

[. Bessière, On forward checking for non-binary constraint satisfaction, International Conference on Principles and Practice of Constraint Programming, pp.88-102, 1999.

[. Bessiere, Arc-consistency and arc-consistency again, Artificial Intelligence, vol.65, issue.1, pp.179-190, 1994.
DOI : 10.1016/0004-3702(94)90041-8

U. Benlic and J. Hao, A Study of Breakout Local Search for the Minimum Sum Coloring Problem, pp.128-137, 2012.
DOI : 10.1007/978-3-642-34859-4_13

L. Hans and . Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, In: SIAM Journal on computing, vol.256, pp.1305-1317, 1996.

[. Boussemart, Boosting systematic search by weighting constraints, In: ECAI, vol.16, p.146, 2004.

C. Bessière and J. Régin, Refining the Basic Constraint Propagation Algorithm, In: IJCAI, vol.1, pp.309-315, 2001.

C. Bessiere and J. Régin, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems'. In: Principles and Practice of Constraint Programming?CP96, pp.61-75, 1996.

F. Bonomo and M. Valencia-pabon, Minimum Sum Coloring of P4-sparse graphs, Electronic Notes in Discrete Mathematics, vol.35, pp.293-298, 2009.
DOI : 10.1016/j.endm.2009.11.048
URL : https://hal.archives-ouvertes.fr/hal-01102515

F. Bonomo and M. Valencia-pabon, On the Minimum Sum Coloring of P 4-Sparse Graphs, Graphs and Combinatorics 30, pp.303-314, 2014.
DOI : 10.1137/S0097539796303123

[. Balas and C. S. Yu, Finding a Maximum Clique in an Arbitrary Graph, SIAM Journal on Computing, vol.15, issue.4, pp.1054-1068, 1986.
DOI : 10.1137/0215075

[. Conte, P. Foggia, and M. Vento, Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs, Journal of Graph Algorithms and Applications, vol.11, issue.1, pp.99-143, 2007.
DOI : 10.7155/jgaa.00139
URL : https://hal.archives-ouvertes.fr/hal-01408699

A. Chmeiss, P. Jégou, and L. Keddar, On a generalization of triangulated graphs for domains decomposition of CSPs, IJCAI. Citeseer, pp.203-208, 2003.

M. Costa, Persistency in maximum cardinality bipartite matchings, Operations Research Letters, vol.15, issue.3, pp.143-149, 1994.
DOI : 10.1016/0167-6377(94)90049-3

[. Cplex, High-performance software for mathematical programming and optimization, 2005.

G. Simon-de, Existential arc consistency: Getting closer to full arc consistency in weighted CSPs, In: IJCAI, vol.5, pp.84-89, 2005.

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990.
DOI : 10.1016/0004-3702(90)90046-3

R. Dechter, Constraint Networks, 1992.
DOI : 10.1016/B978-155860890-0/50003-7

M. Depolli, Exact Parallel Maximum Clique Algorithm for General and Protein Graphs, Journal of Chemical Information and Modeling, vol.53, issue.9, pp.2217-2228, 2013.
DOI : 10.1021/ci4002525

[. Dirac, On rigid circuit graphs, Abhandlungen aus dem Mathematischen Seminar der Universit??t Hamburg, vol.13, issue.1-2, pp.71-76, 1961.
DOI : 10.1016/S1385-7258(51)50053-7

R. Dechter and I. Meiri, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Artificial Intelligence, vol.68, issue.2, pp.211-241, 1994.
DOI : 10.1016/0004-3702(94)90068-X

R. Dechter and J. Pearl, Tree clustering for constraint networks, Artificial Intelligence, vol.38, issue.3, pp.353-366, 1989.
DOI : 10.1016/0004-3702(89)90037-4

T. Simon-de-givry, G. Schiex, and . Verfaillie, Exploiting tree decomposition and soft local consistency in weighted CSP, In: AAAI, vol.6, pp.1-6, 2006.

J. Paul and . Durand, An efficient algorithm for similarity analysis of molecules, Internet Journal of Chemistry, vol.217, pp.1-16, 1999.

R. Delbert, . Fulkerson, A. Oliver, and . Gross, Incidence matrices and interval graphs, In: Pacific J. Math, vol.153, pp.835-855, 1965.

C. Eugene and . Freuder, A sufficient condition for backtrack-bounded search, Journal of the ACM (JACM), vol.324, pp.755-761, 1985.

C. Eugene and . Freuder, Using inference to reduce arc consistency computation

P. Carla, B. Gomes, H. Selman, and . Kautz, Boosting combinatorial search through randomization, AAAI/IAAI 98, pp.431-437, 1998.

J. Gaschig, . Carnegie-mellon, . Univ, . Pa, . Of et al., Performance measurement and analysis of certain search algorithms, 1979.

R. Michael, . Garey, S. David, and . Johnson, A Guide to the Theory of NP-Completeness, p.70, 1979.

M. Gyssens, G. Peter, . Jeavons, A. David, and . Cohen, Decomposing constraint satisfaction problems using database techniques, Artificial Intelligence, vol.66, issue.1, pp.57-89, 1994.
DOI : 10.1016/0004-3702(94)90003-5
URL : http://www.cyberband.rhbnc.ac.uk/research/constraints/publications/pubs-ps/decomposing.ps

N. [. Gottlob, F. Leone, and . Scarcello, A comparison of structural CSP decomposition methods, Artificial Intelligence, vol.124, issue.2, pp.343-282, 2000.
DOI : 10.1016/S0004-3702(00)00078-3

G. Gottlob, N. Leone, and F. Scarcello, Hypertree decompositions and tractable queries, Proceedings of the eighteenth ACM SIGMOD- SIGACT-SIGART symposium on Principles of database systems, pp.21-32, 1999.
DOI : 10.1145/303976.303979
URL : http://arxiv.org/pdf/cs/9812022v1.pdf

]. M. Gol80 and . Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

R. Gomory, . Rand, M. Santa, and . Ca, An algorithm for the mixed integer problem, 1960.

M. Gyssens and J. Paredaens, A Decomposition Methodology for Cyclic Databases, Advances in data base theory, pp.85-122, 1982.
DOI : 10.1007/978-1-4615-9385-0_4

C. P. Gomes and B. Selman, Algorithm portfolios, Artificial Intelligence, vol.126, issue.1-2, pp.43-62, 2001.
DOI : 10.1016/S0004-3702(00)00081-3

P. Ian, T. Gent, and . Walsh, Easy problems are sometimes hard, Artificial Intelligence, vol.701, issue.2, pp.335-345, 1994.

A. Helmar and M. Chiarandini, A local search heuristic for chromatic sum, Proceedings of the 9th metaheuristics international conference, pp.161-170, 2011.

M. Robert, . Haralick, L. Gordon, and . Elliott, Increasing tree search efficiency for constraint satisfaction problems, In: Artificial intelligence, vol.143, pp.263-313, 1980.

[. Harrelson, K. Hildrum, and S. Rao, A polynomial-time tree decomposition to minimize congestion, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '03, pp.34-43, 2003.
DOI : 10.1145/777412.777419

A. Bernardo, R. M. Huberman, T. Lukose, and . Hogg, An Economics Approach to Hard Computational Problems, In: Science, vol.2755296, pp.51-54, 1997.

[. Hoffmann, C. Mccreesh, and C. Reilly, Between Subgraph Isomorphism and Maximum Common Subgraph, 2017.

P. Jégou, Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems', In: AAAI, vol.93, pp.731-736, 1993.

Y. Jin and J. Hao, Hybrid evolutionary search for the minimum sum coloring problem of graphs, Information Sciences, vol.352, issue.353, pp.15-34, 2016.
DOI : 10.1016/j.ins.2016.02.051
URL : https://hal.archives-ouvertes.fr/hal-01412530

Y. Jin, J. Hao, and J. Hamiez, A memetic algorithm for the Minimum Sum Coloring Problem, Computers & Operations Research, vol.43, pp.318-327, 2014.
DOI : 10.1016/j.cor.2013.09.019

Y. Jin, J. Hamiez, and J. Hao, Algorithms for the minimum sum coloring problem: a review, Artificial Intelligence Review, vol.160, issue.16???17, pp.1-28, 2016.
DOI : 10.1016/j.cor.2011.09.010
URL : https://hal.archives-ouvertes.fr/hal-01412512

[. Jégou, H. Kanso, and C. Terrioux, An Algorithmic Framework for Decomposing Constraint Networks, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp.1-8
DOI : 10.1109/ICTAI.2015.15

P. Jégou, S. Ndojh-ndiaye, and C. Terrioux, A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs, 2008 20th IEEE International Conference on Tools with Artificial Intelligence, pp.486-490, 2008.
DOI : 10.1109/ICTAI.2008.116

P. Jégou and C. Terrioux, Hybrid backtracking bounded by treedecomposition of constraint networks, Artificial Intelligence, vol.1461, pp.43-75, 2003.

[. Kadioglu, ISAC-Instance-Specific Algorithm Configuration, In: ECAI, vol.215, pp.751-756, 2010.

[. Karmarkar, A new polynomial-time algorithm for linear programming, Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp.302-311, 1984.
DOI : 10.1007/bf02579150
URL : http://www.eecs.berkeley.edu/~orecchia/working/karmakar full.pdf

U. Kjaerulff, Triangulation of Graphs -Algorithms Giving Small Total State Space, Tech. rep. Judex R.R, 1990.

[. Klee and G. Minty, How good is the simplex algorithm? Inequalities III.(0. SHISHA, pp.159-175, 1972.

[. Kotthoff, C. Mccreesh, and C. Solnon, Portfolios of Subgraph Isomorphism Algorithms, Learning and Intelligent OptimizatioN Conference, 2016.
DOI : 10.1007/s10601-009-9074-3
URL : https://hal.archives-ouvertes.fr/hal-01301829

[. Kotthoff, Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection
DOI : 10.1007/978-3-319-19084-6_18

L. Kotthoff, LLAMA: Leveraging Learning to Automatically Manage Algorithms, 2013.

L. Kotthoff, Algorithm Selection for Combinatorial Search Problems: A Survey, AI Magazine, vol.353, pp.48-60, 2014.
DOI : 10.1007/978-3-319-50137-6_7
URL : http://arxiv.org/abs/1210.7959

E. Kubicka, J. Allen, and . Schwenk, An introduction to chromatic sums, Proceedings of the seventeenth annual ACM conference on Computer science : Computing trends in the 1990's Computing trends in the 1990's, CSC '89, pp.39-45, 1989.
DOI : 10.1145/75427.75430

J. Larrosa, Node and arc consistency in weighted CSP, pp.48-53, 2002.

[. Lekkeikerker and J. Boland, Representation of a finite graph by a set of intervals on the real line, Fundamenta Mathematicae, vol.51, issue.1, pp.45-64, 1962.
DOI : 10.4064/fm-51-1-45-64

C. Lecoutre, Nogood Recording from Restarts, In: IJCAI, vol.7, pp.131-136, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261264

C. Lecoutre, Recording and minimizing nogoods from restarts, In: Journal on Satisfiability Boolean Modeling and Computation, vol.1, pp.147-167, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00191092

[. Lecat, Comparaison de méthodes de résolution pour le probleme de somme coloration, JFPC'15: Journées Francophones de Programmation par Contraintes, 2015.

C. Lecat, Exact methods for the minimum sum coloring problem'. In: DPCP-2015 URL: https, pp.61-69
URL : https://hal.archives-ouvertes.fr/hal-01323741

[. Lecat, C. Lucet, and C. Li, Sum Coloring: New upper bounds for the chromatic strength, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01321029

[. Lecat, C. Lucet, and C. Li, New Lower Bound for the Minimum Sum Coloring Problem, AAAI. 2017, pp.853-859

J. Larrosa and P. Meseguer, Adding constraint projections in n-ary csp, Proceedings of the ECAI, pp.41-48, 1998.

J. Larrosa and T. Schiex, In the quest of the best form of local consistency for weighted CSP, In: IJCAI, vol.3, pp.239-244, 2003.

M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of Las Vegas algorithms, Information Processing Letters, vol.474, pp.173-180, 1993.
DOI : 10.1109/istcs.1993.253477

G. Lueker, Structured breadth first search and chordal graphs, 1974.

K. Alan and . Mackworth, Consistency in networks of relations, In: Artificial intelligence, vol.81, pp.99-118, 1977.

[. Mccreesh, Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems, International Conference on Principles and Practice of Constraint Programming, pp.350-368, 2016.
DOI : 10.1007/978-3-540-87477-5_39
URL : https://hal.archives-ouvertes.fr/hal-01331298

J. James and . Mcgregor, Backtrack search algorithms and the maximal common subgraph problem'. In: Software: Practice and Experience 12, pp.23-34, 1982.

R. Mohr, C. Thomas, and . Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4
URL : https://hal.archives-ouvertes.fr/inria-00548487

M. Minot and S. Ndojh-ndiaye, Searching for a maximum common induced subgraph by decomposing the compatibility graph'. en, Bridging the Gap Between Theory and Practice in Constraint Solvers, p.2014
URL : https://hal.archives-ouvertes.fr/hal-01301095

S. Minot, C. Ndojh-ndiaye, and . Solnon, A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp.461-468
DOI : 10.1109/ICTAI.2015.75
URL : https://hal.archives-ouvertes.fr/hal-01191605

S. Minot, C. Ndojh-ndiaye, and . Solnon, Recherche d'un plus grand sous-graphe commun par décomposition du graphe de compatibilité, Onzièmes Journées Francophones de Programmation par Contraintes (JFPC)

S. Minot, C. Ndojh-ndiaye, and . Solnon, An evaluation of complete approaches for the sum colouring problem URL: https, Douzièmes Journées Francophones de Programmation par Contraintes, 2016.

S. Minot, C. Ndojh-ndiaye, and . Solnon, Using CP and ILP with tree decomposition to solve the sum colouring problem'. In: Doctoral program of CP 2016 URL: https, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01366291

S. Minot, C. Ndojh-ndiaye, and . Solnon, Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem URL: https, CPAIOR 2017, 2017.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

W. Matthew and . Moskewicz, Chaff: Engineering an efficient SAT solver, Proceedings of the 38th annual Design Automation Conference, pp.530-535, 2001.

]. Mou+ and . Moukrim, Upper and lower bounds for the minimum sum coloring problem

A. Moukrim, Lower Bounds for the Minimal Sum Coloring Problem, Electronic Notes in Discrete Mathematics, vol.36, pp.663-670, 2010.
DOI : 10.1016/j.endm.2010.05.084

[. Mccreesh and P. Prosser, Multi-Threading a State-of-the-Art Maximum Clique Algorithm, Algorithms, vol.6, issue.4, pp.618-635, 2013.
DOI : 10.1007/s10878-012-9592-6

[. Mccreesh and P. Prosser, The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound, ACM Transactions on Parallel Computing, vol.2, issue.1, p.5921, 2014.
DOI : 10.1109/ICDE.2013.6544815

[. Ndiaye and C. Solnon, CP Models for Maximum Common Subgraph Problems, pp.637-644, 2011.
DOI : 10.1016/j.artint.2010.05.002
URL : https://hal.archives-ouvertes.fr/hal-01354447

O. Eoin and . Mahony, Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving, Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, 2008.

T. Petit, J. Régin, and C. Bessière, Specific Filtering Algorithms for Over-Constrained Problems, pp.451-463, 2001.
DOI : 10.1007/3-540-45578-7_31
URL : http://www.lirmm.fr/~tpetit/./cp2001-1.ps

R. Clay and P. , Shortest connection networks and some generalizations, Bell Labs Technical Journal, vol.36, issue.6, pp.1389-1401, 1957.

P. Prosser, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational intelligence 9, pp.268-299, 1993.
DOI : 10.1016/0004-3702(77)90007-8
URL : http://www.dcs.gla.ac.uk/%7Epat/cpM/papers/CI9%283%29.pdf

J. Puget, A fast algorithm for the bound consistency of alldiff constraints, pp.359-366, 1998.

P. Paul-walton, Search rearrangement backtracking and polynomial average time, In: Artificial intelligence, vol.211, issue.2, pp.117-133, 1983.

J. Régin, A filtering algorithm for constraints of difference in CSPs, In: AAAI, vol.94, pp.362-367, 1994.

J. Raymond, E. Gardiner, and P. Willett, RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs, The Computer Journal, vol.45, issue.6, pp.631-644, 2002.
DOI : 10.1093/comjnl/45.6.631
URL : http://comjnl.oxfordjournals.org/cgi/reprint/45/6/631.pdf

J. R. Rice, The Algorithm Selection Problem, In: Advances in Computers, vol.15, pp.65-118, 1976.
DOI : 10.1016/S0065-2458(08)60520-3

J. Régin, M. Rezgui, and A. Malapert, Embarrassingly Parallel Search, Principles and Practice of Constraint Programming -19th International Conference Proceedings. 2013, pp.596-610, 2013.
DOI : 10.1007/978-3-642-40627-0_45

M. Jean-charles-régin, A. Rezgui, and . Malapert, Improvement of the Embarrassingly Parallel Search for Data Centers'. In: Principles and Practice of Constraint Programming -20th International Conference, Proceedings. 2014, pp.622-635, 2014.

P. [. Robertson and . Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : https://doi.org/10.1006/jctb.1996.0059

R. [. Rose, G. Tarjan, and . Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021

W. John, P. Raymond, and . Willett, Maximum common subgraph isomorphism algorithms for the matching of chemical structures, Journal of computeraided molecular design, vol.167, pp.521-533, 2002.

[. Selman, A. Henry, B. Kautz, and . Cohen, Local search strategies for satisfiability testing, Cliques, coloring, and satisfiability 26, pp.521-532, 1993.
DOI : 10.1090/dimacs/026/25

M. Sanchez, Russian Doll Search with Tree Decomposition, pp.603-608, 2009.

J. Seipp, Learning Portfolios of Automatically Tuned Planners, 2012.

C. Solnon and S. Fenet, A study of ACO capabilities for solving the maximum clique problem, Journal of Heuristics, vol.6, issue.4, pp.155-180, 2006.
DOI : 10.1007/s10732-006-4295-8
URL : https://hal.archives-ouvertes.fr/hal-01513687

D. Sabin, C. Eugene, and . Freuder, Contradicting conventional wisdom in constraint satisfaction, pp.10-20, 1994.
DOI : 10.1007/3-540-58601-6_86

M. Barbara, . Smith, A. Stuart, and . Grant, Trying harder to fail first, 1997.

M. Richard, . Stallman, J. Gerald, and . Sussman, Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis, In: Artificial intelligence, vol.9, issue.2, pp.135-196, 1977.

T. Schiex and G. Verfaillie, Nogood recording for static and dynamic constraint satisfaction problems, International Journal on Artificial Intelligence Tools, vol.3, pp.2-187, 1994.

G. Team and . Gecode, Generic constraint development environment, 2006.

[. Thomassen, Tight bounds on the chromatic sum of a connected graph, Journal of Graph Theory, vol.13, issue.3, pp.353-357, 1989.
DOI : 10.1002/jgt.3190130310

R. Julian and . Ullmann, An algorithm for subgraph isomorphism, Journal of the ACM (JACM), vol.231, pp.31-42, 1976.

P. Vismara, Programmation par contraintes pour les problemes de plus grand sous-graphe commun'. In: JFPC'11: Journées Francophones de Programmation par Contraintes, pp.327-335, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00617163

[. Waltz, Understanding Line Drawings of Scenes with Shadows The Psychology of Computer Vision, 1975.

Y. Wang, Solving the minimum sum coloring problem via binary quadratic programming', In: Optimization, 2012.

Q. Wu and J. Hao, An effective heuristic algorithm for sum coloring of graphs, Computers & Operations Research, vol.39, issue.7, pp.1593-1600, 2012.
DOI : 10.1016/j.cor.2011.09.010

[. Wu and J. Hao, Improved lower bounds for sum coloring via clique decomposition'. In: arXiv preprint 1303, p.6761, 2013.

L. Xu, H. Hoos, and K. Leyton-brown, Hydra, Proceedings of the 2005 ACM workshop on Storage security and survivability , StorageSS '05, pp.210-216, 2010.
DOI : 10.1145/1103780.1103797

L. Xu, SATzilla: Portfolio-based Algorithm Selection for SAT', In: J. Artif. Intell. Res. (JAIR), vol.32, pp.565-606, 2008.

Y. Zhang, H. Roland, and . Yap, Making AC-3 an optimal algorithm, In: IJCAI, vol.1, pp.316-321, 2001.