Finding all maximally-matchable edges in a bipartite graph
TassaTamir · Theoretical Computer Science · 2012
We consider the problem of finding all maximally-matchable edges in a bipartite graph G=(V,E), i.e., all edges that are included in some maximum matching. We show that given any maximum matching in...