S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.
DOI : 10.1016/0196-6774(91)90006-K
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2544

H. L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.1-2, pp.1-45, 1998.
DOI : 10.1016/S0304-3975(97)00228-4

H. L. Bodlaender and R. H. Möhring, The Pathwidth and Treewidth of Cographs, SIAM Journal on Discrete Mathematics, vol.6, issue.2, pp.181-188, 1993.
DOI : 10.1137/0406014

H. L. Bodlaender and B. Van-antwerpen-de-fluiter, Reduction Algorithms for Graphs of Small Treewidth, Information and Computation, vol.167, issue.2, pp.86-119, 2001.
DOI : 10.1006/inco.2000.2958

R. B. Borie, R. G. Parker, and C. A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, vol.50, issue.1-6, pp.555-581, 1992.
DOI : 10.1145/322326.322328

R. B. Borie, R. G. Parker, and C. A. Tovey, Solving problems on recursively constructed graphs, ACM Computing Surveys, vol.41, issue.1, 2008.
DOI : 10.1145/1456650.1456654
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.7981

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle and I. Durand, Fly-Automata, Their Properties and Applications, Proceedings of the 16th International Conference on Implementation and Application of Automata, CIAA 2011, pp.264-272, 2011.
DOI : 10.1007/BF01691346
URL : https://hal.archives-ouvertes.fr/hal-00588456

B. Courcelle and M. Mosbah, Monadic second-order evaluations on tree-decomposable graphs, Theoretical Computer Science, vol.109, issue.1-2, pp.49-82, 1993.
DOI : 10.1016/0304-3975(93)90064-Z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.3724

C. Daskalakis and C. H. Papadimitriou, Computing pure nash equilibria in graphical games via markov random fields, Proceedings of the 7th ACM conference on Electronic commerce , EC '06, pp.91-99, 2006.
DOI : 10.1145/1134707.1134718

M. Elberfeld, A. Jakoby, and T. Tantau, Logspace Versions of the Theorems of Bodlaender and Courcelle, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp.143-152, 2010.
DOI : 10.1109/FOCS.2010.21

M. R. Fellows and M. A. Langston, An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations, 30th Annual Symposium on Foundations of Computer Science, pp.520-525, 1989.
DOI : 10.1109/SFCS.1989.63528

F. V. Jensen and T. D. Nielsen, Bayesian Networks and Decision Graphs Information Science and Statistics series, 2007.

V. Kabanets, Recognizability equals definability for partial k-paths, Proceedings of the 24th International Colloquium on Automata, Languages and Programming, ICALP'97, pp.805-815, 1997.
DOI : 10.1007/3-540-63165-8_233
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.9305

D. Kaller, Definability equals recognizability of partial 3-trees and k-connected partial k-trees. Algorithmica, pp.348-381, 2000.
DOI : 10.1007/s004530010024

A. M. Koster, S. P. Van-hoesel, and A. W. Kolen, Solving partial constraint satisfaction problems with tree decomposition, Networks, vol.7, issue.3, pp.170-180, 2002.
DOI : 10.1002/net.10046

S. J. Lauritzen and D. J. Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, The Journal of the Royal Statistical Society. Series B (Methodological), vol.50, pp.157-224, 1988.

J. Pearl, Probablistic Reasoning in Intelligent Systems: Networks of Plausible Inference, 1988.

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.1996.0059

D. Roth, On the hardness of approximate reasoning, Artificial Intelligence, vol.82, issue.1-2, pp.273-302, 1996.
DOI : 10.1016/0004-3702(94)00092-1

L. C. Van and . Gaag, Probability-Based Models for Plausible Reasoning, 1990.

T. V. Wimer, Linear Algorithms on k-Terminal Graphs, 1987.