Which of the given problems are NP-complete?
(a) Node cover problems
(b) Directed Hamilton Circuit Problem
(c) Both (a) and (b)
(d) None of the mentioned
The question was asked in exam.
Enquiry is from Node-Cover Problem, Hamilton Circuit Problem topic in division Intractable Problems of Automata Theory