How can i find maximum perfect matching in bipartite graph? it can be a a sub-graph of main bipartite graph?(a subset of vertex from left side and a subset of vertex from right side and they are perfect match).
if we take a vertex, each vertex that shares a edge with the selected vertex must be present in the subset of vertex too.