Holger Bast Kurt Mehlhorn Guido Schäfer Hisao Tamaki Matching Algorithms Are Fast in Sparse Random Graphs. 81-92 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2996&spage=81 2004 conf/stacs/2004 STACS db/conf/stacs/stacs2004.html#BastMST04