Answers are grounded in this paper and cite their sources.
Using the theory of smooth approximations, we give a new and algebraic proof that for any set F of finite tournaments, the problem of orienting a finite graph whilst avoiding all members of F is either in P or NP-complete. We characterize both cases by algebraic conditions.
No takes yet. Share an insight, caveat, or question.
Feller et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: