1
$\begingroup$

Is the decision problem In-Dominating Set NP-complete for digraphs of regular out-degree (greater than $\frac{n-2}{4}$, in particular)? -- I'm mainly looking for a reference.

Thanks for any answer!

Improve this question
$\endgroup$

0

Reset to default

You must log in to answer this question.