The diameter of random massive graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 912-921

  Lu, Linyuan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Measurement; Theory; Verification

Indexed keywords

EID: 64049114721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

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. L. A. Adamic and B. A. Huberman, Growth dynamics of the World Wide Web, Nature , 401, September 9, 1999, pp. 131.
3. William Aiello , Fan Chung , Linyuan Lu, A random graph model for massive graphs, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.171-180, May 21-23, 2000, Portland, Oregon, United States [doi〉10.1145/335305.335326]
4. W. Aiello, F. Chung and L. Lu, Random evolution in massive graphs, preprint.
5. Rdka Albert, Hawoong Jeong, and Albert-Laiszl6 Barabaisi, Diameter of the World Wide Web, Nature 401 (1999) 130-131.
6. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley and Sons, New York, 1992.
7. Albert-Laszlo Barabasi, Reka Albert, Emergence of scaling in random networks, Science 286 (1999) 509- 512.
8. A. Barabai, R. Albert, and H. Jeong Scale-free characteristics of random networks: the topology of the world wide web, Elsevier Preprint August 6, 1999.
9. B. Bolloba, The Diameter of Random Graphs. IEEE Trans. Inform. Theory 36 (1990), no. 2, 285-288.
10. B. Bollobais, Random Graphs Academic Press, (1985).
11. B. Bolloba, The evolution of sparse graphs, Graph Theory and Combinatorics (Cambridge 1983), 35-57, Academic Press, London-New York, 1984.
12. Andrei Broder , Ravi Kumar , Farzin Maghoul , Prabhakar Raghavan , Sridhar Rajagopalan , Raymie Stata , Andrew Tomkins , Janet Wiener, Graph structure in the Web, Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking, p.309-320, June 2000, Amsterdam, The Netherlands
13. J. D. Burtin, Extremal metric characteristics of a random graph I, Theo. Verojatnost. i Primenen 19 (1974), 740-754.
14. J. D. Burtin, Extremal metric characteristics of a random graph II, Theo. Verojatnost. i Primcnen 20 (1975), 82-99.
15. P. ErdSs and A. Rdnyi, On random graphs. I, Publ. Math. Debrecen 6 (1959), 290-291.
16. Fan Chung and Linyuan Lu, The Diameter of Random Sparse Graphs, preprint. http://euclid.ucsd.edu/llu/diameter.ps.
17. 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
18. V. Klee and D. Larman, Diameters of random graphs. Canad. J. Math. 33 (1981) 618-640.
19. 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, 1999.
20. 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
21. 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
22. Lawrence, S. and Giles, C. L. Nature 400, (1999) 107-109.
23. Tomasz Łuczak, Random trees and random graphs, Random Structures & Algorithms, v.13