On the Determination of Minimum Feedback Arc and Vertex Sets

A method presented by Lempel and Cederbaum to find minimum feedback arc and vertex sets in directed graphs is shown to be partly equivalent to the well-known prime implicant problem of switching theory.