A random graph model for massive graphs

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	James Abello , Adam L. Buchsbaum , Jeffery Westbrook, A Functional Approach to External Graph Algorithms, Proceedings of the 6th Annual European Symposium on Algorithms, p.332-343, August 24-26, 1998
	2	W. Aiello, F. Chung, L. Lu, Random evolution of power law graphs, manuscript.
	3	R. Albert, H. Jeong and A. Barab~isi, Diameter of the World Wide Web, Nature, 401, September 9, 1999.
	4	N. Alon and J. H. Spencer, The Probabilistic Method, Wiley and Sons, New York, 1992.
	5	A. Baxabgsi, and R. Albert, Emergence of scaling in random networks, Science, 286, October 15, 1999.
	6	A. Barab~isi, R. Albert, and H. Jeong Scale-free characteristics of random networks: the topology of the world wide web, Elsevier Preprint August 6, 1999.
	7	P. Erdfs and A. R~nyi, On the evolution of random graphs, PubI. Math. Inst. Hung. Acad. Sci. 5 (1960), 17-61.
	8	P. Erd6s and A. R~nyi, On the strength of connectedness of random graphs, Acta Math. Acad. Sci. Hungar. 12 (1961), 261-267.
	9	Michalis Faloutsos , Petros Faloutsos , Christos Faloutsos, On power-law relationships of the Internet topology, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, p.251-262, August 30-September 03, 1999, Cambridge, Massachusetts, United States
	10	J. Kleinberg, S. R. Kumar, P. Raphavan, S. Rajagopalan and A. Tomkins, The web as a graph: Measurements, models and methods, Proceedings of the International Conference on Combinatorics and Computing, July 26-28, 1999.
	11	Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins, Trawling the Web for emerging cyber-communities, Proceeding of the eighth international conference on World Wide Web, p.1481-1493, May 1999, Toronto, Canada
	12	Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins, Extracting Large-Scale Knowledge Bases from the Web, Proceedings of the 25th International Conference on Very Large Data Bases, p.639-650, September 07-10, 1999
	13	Tomasz Luczak, Sparse random graphs with a given degree sequence, Random Graphs, vol 2 (Poznafi, 1989), 165-182, Wiley, New York, 1992.
	14	Michael Molloy , Bruce Reed, A critical point for random graphs with a given degree sequence, Random Structures & Algorithms, v.6 n.2-3, p.161-179, March-May 1995
	15	Michael Molloy , Bruce Reed, The Size of the Giant Component of a Random Graph with a Given Degree Sequence, Combinatorics, Probability and Computing, v.7 n.3, p.295-305, September 1998 [doi>10.1017/S0963548398003526]
	16	P. Raghavan, personal communication.
	17	N. C. Wormald, The asymptotic connectivity of labeled regular graphs, J. Comb. Theory (B) 31 (1981), 156-167.
	18	N. c. Wormald, Models of random regular graphs, surveys in Combinatorics, 1999 (LMS Lecture Note Series 267, Eds J.D.Lamb and D.A.Preece), 239-298.