P. Adjiman, P. Chatalic, F. Goasdoué, M. Rousset, and L. Simon, Distributed reasoning in a peer-to-peer setting: Application to the semantic web, Journal of Artificial Intelligence Research (JAIR), vol.25, pp.269-314, 2006.

A. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

I. Brito and P. Meseguer, Cluster tree elimination for distributed constraint optimization with quality guarantees, Fundam. Inform, vol.102, issue.3-4, pp.263-286, 2010.

R. Dechter, Constraint processing, 2003.

R. Dechter, Tractable Structures for Constraint Satisfaction Problems, Handbook of Constraint Programming, part I, chapter 7, pp.209-244, 2006.
DOI : 10.1016/S1574-6526(06)80011-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.6323

A. Dermaku, T. Ganzow, G. Gottlob, B. J. Mcmahan, N. Musliu et al., Heuristic Methods for Hypertree Decomposition, MICAI, pp.1-11, 2008.
DOI : 10.1016/0196-6774(86)90023-4

R. Ezzahir, C. Bessiere, I. Benelallam, and M. Belaissaoui, Asynchronous breadth first search dcop algorithm, Applied Mathematical Sciences, vol.2, pp.37-401837, 2008.

B. Faltings, T. Léauté, and A. Petcu, Privacy Guarantees through Distributed Constraint Satisfaction, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp.350-358, 2008.
DOI : 10.1109/WIIAT.2008.177
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6720

Y. El, F. , and R. Dechter, Diagnosing tree-decomposable circuits, IJCAI, pp.1742-1749, 1995.

A. Favier, P. Simon-de-givry, and . Jégou, Exploiting Problem Structure for Solution Counting, CP, pp.335-343, 2009.
DOI : 10.1007/11499107_24

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

S. Grumbach and Z. Wu, Distributed tree decomposition of graphs and applications to verification, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), pp.1-8, 2010.
DOI : 10.1109/IPDPSW.2010.5470828

C. Guestrin and G. J. Gordon, Distributed planning in hierarchical factored mdps, UAI, pp.197-206, 2002.

J. Huang and A. Darwiche, The language of search, J. Artif. Intell. Res. (JAIR), vol.29, pp.191-219, 2007.

P. Jégou, S. Ndiaye, and C. Terrioux, Dynamic heuristics for backtrack search on tree-decomposition of csps, IJCAI, pp.112-117, 2007.

K. Kask, R. Dechter, J. Larrosa, and A. Dechter, Unifying tree decompositions for reasoning in graphical models, Artificial Intelligence, vol.166, issue.1-2, pp.165-193, 2005.
DOI : 10.1016/j.artint.2005.04.004

T. Léauté and B. Faltings, Coordinating logistics operations with privacy guarantees, IJCAI, pp.2482-2487, 2011.

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

A. Petcu and B. Faltings, A scalable method for multiagent constraint optimization, IJCAI, pp.266-271, 2005.

G. Provan and J. Wuang, Automated benchmark model generators for model-based diagnostic inference, IJCAI, pp.513-518, 2007.

N. Robertson and P. D. 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 : http://doi.org/10.1006/jctb.1999.1919

S. Subbarayan, L. Bordeaux, and Y. Hamadi, Knowledge compilation properties of tree-of-bdds, AAAI, pp.502-507, 2007.

T. Walsh, Search in a small world, IJCAI, pp.1172-1177, 1999.

J. Duncan, S. H. Watts, and . Strogatz, Collective dynamics of`smallof` of`small-world´networksworld´networks, Nature, vol.393, issue.6684, pp.440-442, 1998.