A further example is Bounded Indegree \(c\) -BNSL (BI-\(c\) -BNSL) which is defined for every constant \(c\) .
In BI-\(c\) -BNSL one aims to learn a network that contains at most \(k\)  vertices that have more than \(c\)  parents for a given integer \(k\) .
This scenario can be modeled with triples \((P,s,\omega )\)  where \(\omega =1\)  if \(|P| > c\)  and \(\omega =0\) , otherwise.
To the best of our knowledge, this is a sparsity constraint that has not been analyzed so far. Next, we observe that W-BNSL is solvable in polynomial time if the superstructure is a DAG. This generalizes algorithms for BNSL [1]} and BA-BNSL [2]}.
