. Jégou and P. Jégou, Decomposition of domains based on the micro-structure of finite constraint-satifaction problems, Proceedings of the Eleventh National Conference on Artificial Intelligence, 1993.

A. Chmeiss, P. Jégou, and L. Keddar, Sur une généralisation des graphes triangulés et son application pour la décomposition de domaines dans les csp, Actes JNPC, 2003.

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, p.14, 1980.
DOI : 10.1016/0004-3702(80)90051-X

R. R. Judex, Kjaerulff : Triangulation of graphs -algorithms giving small total state space, 1990.

A. Berry, A wide-range efficient algorithm for minimal triangulation, Proceedings of SO- DA'99 SIAM Conference, 1999.

A. Chmeiss and P. Jégou, A generalization of chordal graphs and the maximum clique problem, Information Processing Letters, vol.62, issue.2, p.62, 1997.
DOI : 10.1016/S0020-0190(97)00044-6

. Habbas and K. Singer, Domain decomposition for parallel resolution of constraints satisfaction problems with openmp, Proceedings of the second European Workshop on OpenMP, 2000.

D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, PPCP'94, 1994.
DOI : 10.1007/3-540-58601-6_86