Question: In a directed graph, the indegree of a node is the number of incoming edges and the outdegree is the number of outgoing edges. Show
In a directed graph, the indegree of a node is the number of incoming edges and the outdegree is the number of outgoing edges. Show that the following problem is NP-complete. Given an undirected graph G and a designated subset C of Gs nodes, is it possible to convert G to a directed graph by assigning directions to each of its edges so that every node in C has indegree 0 or outdegree 0, and every other node in G has indegree at least 1?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
