An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
1973Published
2.0KCitations
0References
journal articleType
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 $.
Journal: SIAM Journal on Computing
Publisher: Society for Industrial & Applied Mathematics (SIAM)
Citations are the number of DOI-registered works in Crossref that cite this paper; references are how many works it cites. Full text is on the publisher site via the DOI link.