FEEDBACK VERTEX SETINSTANCE: Directed graph G = (V, A), positive integer K <=>=>QUESTION: Is there a subset V’ of V such that |V’| <= k="" and="" every="" directed="" circuit="" in="" g="" includes="" at="" least="" one="" vertex="" from="">=>
Write the proof that the following problem is in NP (not NP-complete)
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here