A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

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.

[1]  M. Hall.  Distinct representatives of subsets , 1948 .

[2]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[3]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[4]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.