Abstract
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. © 1997 John Wiley & Sons, Inc.
Cite
CITATION STYLE
APA
Frieze, A., & McDiarmid, C. (1997). Algorithmic Theory of Random Graphs. Random Structures and Algorithms, 10(1–2), 5–42. https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-z
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free