The width of a problem is the minimal width of its decompositions .
The width of such a decomposition is the maximal size of the sets associated with nodes , which is one if the original problem is acyclic and the size of its minimal hypercutset otherwise .
The width of a problem is the minimal width of width 's decompositions .
The width of such a decomposition is the maximal size of the sets associated with nodes , which is one if the original problem is acyclic and the size of its minimal hypercutset otherwise .