The width of a problem is the minimal width of its tree - clustering decompositions .
The width of a tree - clustering decomposition is the maximal number of variables associated with each node of the tree .
The width of a problem is the minimal width of width 's tree - clustering decompositions .
The width of a tree - clustering decomposition is the maximal number of variables associated with each node of the tree .