Cutset Conditioning Algorithm
Computes an optimal Cutset for a CSP and an existing Cutset .
Pseudocode
Running Time
The algorithm is exponential only in the number of nodes in not in .
However finding optimal cutsets is NP-hard. There exist approximations which can be solved easier.