Question: Show that the following problem is NP-complete. DOMINATING SET: Given a directed graph G and an integer B, is there a set S of B
Show that the following problem is NP-complete. DOMINATING SET: Given a directed graph G and an integer B, is there a set S of B nodes of G such that for every node u (is not an element) S of G, there is a node v (is an element) S such that (v, u) is an edge of G.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
