Vidyalelo
Data Structure · Q684

Miscellaneous on Data Structures

Programming · Data Structure · question 684

Q684

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
Answer
D.
Weight matching

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board