Perfect Matching in Bipartite Graph Given a bipartite graph G(V,W,E)with IVI Wl, 。. Matching:a collection of vertex-disjoint edges Perfect matching:every vertex gets matched Men WomenPerfect Matching in Bipartite Graph • Given a bipartite graph G(V, W, E) with |V| = |W|, • Matching: a collection of vertex-disjoint edges • Perfect matching: every vertex gets matched Men Women