3 citations · 6 across the 5 of their papers we have counts for
1 paper · 1 filter
Tamir Tassa
We consider the problem of finding all allowed 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 matc…