Greedy Algorithm compatibility and heavy-set structures

Optimization of Pearl‘s method of condit

Optimization of Pearl‘s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem : A. Becker and D. Geiger

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Forthcoming Papers ## A. Becker and D. Geiger, Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of c