Suppose vi and v2 are the bipartition sets in a bipartite


Question: (a) Suppose VI and V2 are the bipartition sets in a bipartite graph G. If |V1| > |V2|, then it is clearly impossible to find a matching which saturates V1. State a result which is applicable to this case and give a necessary and sufficient condition for your result to hold.

(b) How should your result in (a) be interpreted when applied to the job assignment problem?

Solution Preview :

Prepared by a verified Expert
Mathematics: Suppose vi and v2 are the bipartition sets in a bipartite
Reference No:- TGS02365574

Now Priced at $10 (50% Discount)

Recommended (92%)

Rated (4.4/5)