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

💬 Discuss

✅ Correct Answer: (A) 5

Explanation: 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.

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

Explanation by: Mr. Dubey

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.

💬 Discussion

📊 Question Analytics

👁️

587

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate