Matching Algorithms Are Fast in Sparse Random Graphs.

Hannah Bast, Kurt Mehlhorn, Guido Schfer, Hisao Tamaki

Browse the full STACS paper archive.