A

Admin • 802.91K Points
Coach

Q. The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

  • (A) maximum- mass matching
  • (B) maximum bipartite matching
  • (C) maximum weight matching
  • (D) maximum node matching
Explanation by: Admin
the problem is called as maximum weight matching which is similar to a bipartite matching. it is also called as assignment problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.