Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call