Let G = (V , E) be a bipartite graph; suppose its nodes are partitioned into sets X and Y so that each edge has one end in X and the other in Y.We define an (a, b)-skeleton of G to be a set of edges E c E so that at most a nodes in X are incident to an edge in E', and at least b nodes in Y are incident to an edge in E'.
Show that, given a bipartite graph G and numbers a and b, itisNP-complete to decide whether G has an (a, b)-skeleton.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.