The theory of random graphs has been mainly concerned with structural properties, in particular the most likely values of various graph invariants—see Bollobàs [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.
No takes yet. Share an insight, caveat, or question.
Alan Frieze (1997) studied this question.