Alt, H., Blum, N., Mehlhorn, K., & Paul, M. (1991). Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(n^1.5 sqrt(m/log n)). Information Processing Letters, 37(4), 237-240. doi:10.1016/0020-0190(91)90195-N.