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]

Authors

Holger Bast

This author has not been identified. Look up 'Holger Bast' in Google

Kurt Mehlhorn

This author has not been identified. Look up 'Kurt Mehlhorn' in Google

Guido Schäfer

This author has not been identified. Look up 'Guido Schäfer' in Google

Hisao Tamaki

This author has not been identified. Look up 'Hisao Tamaki' in Google