Amin Coja-Oghlan Solving NP-hard semirandom graph problems in polynomial expected time. 19-46 2007 62 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.07.003 db/journals/jal/jal62.html#Coja-Oghlan07