Feedback Arc Set Decision Problem

Definition

Feedback Arc Set Decision Problem

Given a digraph $G=(U,A)$ and a non-negative integer $h$. The problem asks whether we can reverse at most $h$ arcs to make $G$ acyclic graph.