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]
@article{BastMST06,
title = {Matching Algorithms Are Fast in Sparse Random Graphs},
author = {Holger Bast and Kurt Mehlhorn and Guido Schäfer and Hisao Tamaki},
year = {2006},
doi = {10.1007/s00224-005-1254-y},
url = {http://dx.doi.org/10.1007/s00224-005-1254-y},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BastMST06},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {39},
number = {1},
pages = {3-14},
}