===Maximum cardinality bipartite matching===Given a bipartite graph "G" = ("X"∪"Y", "E"), we are to find a maximum cardinality matching in "G", that is a matching that contains the largest possible number of edges.
=== Maximum cardinality bipartite matching ===Given a bipartite graph "G" = ("X"∪"Y", "E"), we are to find a maximum cardinality matching in "G", that is a matching that contains the largest possible number of edges.