![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
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 |
Answer» C. maximum weight matching | |
Explanation: the problem is called as maximum weight matching which is similar to a bipartite matching. it is also called as assignment problem. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet