Such decomposition trees may however have width ( number of nodes in each node ) larger than optimal .
The memory required for storing these constraints can be decreased by using a tree decomposition with small separators .
Such decomposition trees may have width ( number of nodes in each node ) larger than optimal .
The memory required for storing these constraints can be decreased by using a tree decomposition with small separators .