Key points are not available for this paper at this time.
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n) n. Keywordsalgorithmalgorithmic analysisbipartite graphscomputational complexitygraphsmatching
Hopcroft et al. (Sat,) studied this question.