This refers to finding the largest possible matching within a bipartite graph, and is an important problem in network flow applications.
This refers to finding the largest possible matching within a bipartite graph, and is an important problem in network flow applications.