Holger Bast Kurt Mehlhorn Guido Schäfer Hisao Tamaki Matching Algorithms Are Fast in Sparse Random Graphs. 3-14 2006 39 Theory Comput. Syst. 1 http://dx.doi.org/10.1007/s00224-005-1254-y db/journals/mst/mst39.html#BastMST06