This can be exploited by doing search on a set of variables that is not a cycle cutset but leaves the problem, once removed, to be have induced width bounded by some value . Such set of variables is called a -cutset of the problem.
This technique involves using a search on a set of variables that are not part of a cycle cutset to solve a problem. The resulting problem has a restricted width, bounded by a specific value.