Computing a maximum cardinality matching in a bipartite graph in time O(n 1.5√ m/ log n (1991)

by H Alt, N Blum, K Mehlhorn, M Paul