Finding a Path is Harder than Finding a Tree

06/09/2011

∙

by   C. Meek, et al.

∙

0

∙

share

I consider the problem of learning an optimal path graphical model from data and show the problem to be NP-hard for the maximum likelihood and minimum description length approaches and a Bayesian approach. This hardness result holds despite the fact that the problem is a restriction of the polynomially solvable problem of finding the optimal tree graphical model.