On smoothed analysis in dense graphs and formulas
KrivelevichMichael, SudakovBenny, TetaliPrasad · Random Structures and Algorithms · 2006
We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by Bohman and colleagu...