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
This question was addressed to me in a national level competition.
I need to ask this question from Matching topic in portion Matching of Data Structures & Algorithms II