Beyond Trees
When we consider more complex network, the problem is not as easy
Suppose we allow two parents
A greedy algorithm is no longer guaranteed to find the optimal network
In fact, no efficient algorithm exists
Theorem: Finding maximal scoring network structure with at most k parents for each variables is NP-hard for k > 1