Graph orientation satisfying that all nodes in a given subset have in- or out-degree 0, and every other node positive indegree
We show that it is hard to orient a digraph such that all nodes in a given subset have in- or out-degree 0, and every other node positive indegree.
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):