Matching Algorithms Are Fast in Sparse Random Graphs

Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki. Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst., 39(1):3-14, 2006. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: