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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.