A

Admin • 832.70K Points
Coach

Q. From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?

  • (A) 5
  • (B) 4
  • (C) 3
  • (D) 2

Explanation by: Admin

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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.