An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

Abstract

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)\sqrt n $.Keywordsalgorithmalgorithmic analysisbipartite graphscomputational complexitygraphsmatching