Abstract

The LOOP CUTSET problem was historically posed by Pearl as a subroutine in Pearl’s
algorithm for computing inference in probabilistic networks. The efficiency of the
algorithm that solves the probabilistic inference highly depends on the size of the
smallest known LOOP CUTSET. This justifies the search for exact algorithms for find-
ing a minimum
... read more