Highly Influenced

# Algorithmic theory of random graphs

@article{Frieze1997AlgorithmicTO, title={Algorithmic theory of random graphs}, author={Alan M. Frieze and Colin McDiarmid}, journal={Random Struct. Algorithms}, year={1997}, volume={10}, pages={5-42} }

- Published 1997 in Random Struct. Algorithms
DOI:10.1002/(SICI)1098-2418(199701/03)10:1/2%3C5::AID-RSA2%3E3.0.CO;2-Z

The theory of random graphs has been mainly concerned with structural w x properties, in particular the most likely values of various graph invariants}see Bollobas 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. Q 1997 Ž . John Wiley & Sons, Inc. Random Struct. Alg., 10, 5]42 1997