In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?

(A) bipartite matching
(B) cardinality matching
(C) augmenting
(D) weight matching

💬 Discuss

✅ Correct Answer: (C) augmenting

Explanation: a simple path from a free vertex in v to a free vertex in u whose edges alternate between edges not in m and edges in m is called a augmenting path.

Explanation by: Mr. Dubey

a simple path from a free vertex in v to a free vertex in u whose edges alternate between edges not in m and edges in m is called a augmenting path.

💬 Discussion

📊 Question Analytics

👁️

575

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate