On smoothed analysis in dense graphs and formulas

: 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 colleagues (Random Struct Algor 22 (2003), 33

• Type: Journal
• Year: 2006
• Where: RSA
• Authors: Michael Krivelevich, Benny Sudakov, Prasad Tetali
• Keywords: Random, Random Instance, Random Struct Algor, RSA 2006