An exact cover problem can be represented using:
(a) incidence matrix
(b) bipartite graph
(c) both (a) and (b)
(d) none of the mentioned
I got this question in an interview for internship.
My question is based upon Node-Cover Problem, Hamilton Circuit Problem topic in chapter Intractable Problems of Automata Theory