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
The question was asked in an online interview.
This is a very interesting question from Matching in portion Matching of Data Structures & Algorithms II