The treewidth of a problem is the minimal width of its tree decompositions .
The width of such a decomposition is the maximal number of variables associated to the same node minus one .
The treewidth of a problem is the minimal width of width 's tree decompositions .
The width of such a decomposition is the maximal number of variables associated to the same node minus one .