From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
|Answer» A. 5|
|Explanation: one of the solutions of the matching problem is given by a-w,b-v,c-x,d- y,e-z. hence the answer is 5.|
Login to Continue
It will take less than 2 minutes