Erdos-Renyi AlgorithmP. Erdos and A. Renyi, On random graphs. I, Publ. Math. Debrecen 6 (1959), 290-291P. Erdos and A. Renyi, On the Evolution of Random Graphs, Mat. Kutato Int. Kozl 5 (1960), 17-60 P. Erdos and A. Renyi, On the strength of connectedness of random graphs, Acta Math. Acad. Sci. Hungar. 12 (1961), 261-267 The Erdos-Renyi random graph model is the algorithm first studied in random graph generation. It begins with a set number of vertices and randomly adds an edge between every pair of edges with probability p. |