Matching algorithms are fast in sparse random graphs (0)

by H Bast, K Mehlhorn, G Schafer, H Tamaki
Venue:Theory of Computing Systems