Abstract not found

The theory of random graphs has been mainly concerned with structural properties, in particular the most likely values of various graph invariants -- see Bollob`as [21]. There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this paper we survey some of the results in this area. 1 Introduction The theory of random graphs as initiated by Erdos and R'enyi [52] and developed along with others, has been mainly concerned with structural properties, in particular the most likely values of various graph invariantss -- see Bollob`as [21]. There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. We would like in this paper to survey some of the results in this area. We hope to be fairly comprehensive in terms of the areas we tackle and so depth will be sacrificed in favour of breadth. One attractive feature of average case analysis is that it banishes the pessimism o...