Kurt Mehlhorn
-
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
LEDA: a platform for combinatorial and geometric computing