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

💬 Discuss

✅ Correct 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.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the problem is called as maximum weight matching which is similar to a bipartite matching. it is also called as assignment problem.

💬 Discussion

📊 Question Analytics

👁️

514

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate