William Aiello
- 1.J. Abello, A. Buchsbaum, and J. Westbrook, A functional approach to external graph algorithms, Proc. 6th European Symposium on Algorithms, pp. 332-343, 1998.]] Google Scholar
Digital Library
- 2.W. Aiello, F. Chung, L. Lu, Random evolution of power law graphs, manuscript.]]Google Scholar
- 3.R. Albert, H. Jeong and A. Barab~isi, Diameter of the World Wide Web, Nature, 401, September 9, 1999.]]Google Scholar
- 4.N. Alon and J. H. Spencer, The Probabilistic Method, Wiley and Sons, New York, 1992.]]Google Scholar
- 5.A. Baxabgsi, and R. Albert, Emergence of scaling in random networks, Science, 286, October 15, 1999.]]Google Scholar
- 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.]]Google Scholar
- 7.P. Erdfs and A. R~nyi, On the evolution of random graphs, PubI. Math. Inst. Hung. Acad. Sci. 5 (1960), 17-61.]]Google Scholar
- 8.P. Erd6s and A. R~nyi, On the strength of connectedness of random graphs, Acta Math. Acad. Sci. Hungar. 12 (1961), 261-267.]]Google Scholar
- 9.M. Faloutsos, P. Faloutsos, and C. Faloutsos, On powerlaw relationships of the internet topology, Proceedings of the A GM SIGCOM Conference, Cambridge, MA, 1999.]] Google ScholarDigital Library
- 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.]]Google ScholarDigital Library
- 11.S. R. Kumax, P. Raphavan, S. Rajagopalan and A. Tomkins, Trawling the web for emerging cyber communities, Proceedings of the 8th World Wide Web Conference, Edinburgh, Scotland, May 15-19, 1999.]] Google ScholarDigital Library
- 12.S.R. Kumar, P. Raghavan, S. Rajagopalan and A. TomkJns, Extracting large-scale knowledge bases from the web, Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, September 7-10, 1999.]] Google ScholarDigital Library
- 13.Tomasz Luczak, Sparse random graphs with a given degree sequence, Random Graphs, vol 2 (Poznafi, 1989), 165-182, Wiley, New York, 1992.]]Google Scholar
- 14.Michael Molloy and Bruce Reed, A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, Vol. 6, no. 2 and 3 (1995). 161-179.]] Google ScholarDigital Library
- 15.Michael Molloy and Bruce Reed, The size of the giant component of a random graph with a given degree sequence, Combin. Probab. Com2ut. 7, no. (1998), 295-305.]] Google ScholarDigital Library
- 16.P. Raghavan, personal communication.]]Google Scholar
- 17.N. C. Wormald, The asymptotic connectivity of labeled regular graphs, J. Comb. Theory (B) 31 (1981), 156-167.]]Google ScholarCross Ref
- 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.]]Google Scholar
Index Terms
- A random graph model for massive graphs
Recommendations
Turán's theorem for pseudo-random graphs
The generalized Turan number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H. When G is the complete graph K"m on m vertices, the value of ex(K"m,H) is (1-1/(@g(H)-1)+o(1))(m2), where o(1)->0 as m->~, by ...
Equitable coloring of random graphs
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the ...
The clique-separator graph for chordal graphs
We present a new representation of a chordal graph called the clique-separator graph, whose nodes are the maximal cliques and minimal vertex separators of the graph. We present structural properties of the clique-separator graph and additional ...
Comments