Graph theory in practice: Part II

American Scientist

Volumn 88, Issue 2, 2000, Pages 104-109

  Hayes, Brian ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000836238     PISSN: 00030996     EISSN: None     Source Type: Journal    
DOI: 10.1511/2000.2.104     Document Type: Article

References (15)

1. Adamic, Lada A. 1999. The small world Web. http://www. parc.xerox.com/istl/groups/iea/www/smallworld.html
2. Aiello, William, Fan Chung and Linyuan Lu. 1999. A random graph model for massive graphs. To appear in Proceedings of the 32d Annual ACM Symposium on the Theory of Computing. http://math.ucsd.edu/~fan/ random.ps
3. Albert, Reka, Hawoong Jeong and Albert-László Barabási. 1999. Diameter of the World Wide Web. Nature 401:130-131. http://xxx.lanl.gov/abs/cond-mat/ 9907038
4. Barabási, Albert-László, and Réka Albert. 1999. Emergence of scaling in random networks. Science 286:509-512. http://www.nd.edu/~networks/science.pdf
5. Barabási, Albert-László, Reka Albert and Hawoong Jeong. 1999. Scale-free characteristics of random networks: The topology of the World Wide Web. http:// www.nd.edu/~networks/proceeding.ps
6. Bollobás, Béla. 1985. Random Graphs. London: Academic Press.
7. Bollobás, B., and F. R. K. Chung. 1988. The diameter of a cycle plus a random matching. SIAM Journal on Discrete Mathematics 1:328-333.
8. Chung, F. R. K., and M. R. Garey. 1984. Diameter bounds for altered graphs. Journal of Graph Theory 8:511-534.
9. Erdös, P., and A. Rényi. 1960. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5:17-61.
10. Faloutsos, Michails, Petros Faloutsos and Christos Faloutsos. 1999. On power-law relationships of the Internet topology. Computer Communication Review 29(4):251-262. http://www.acm.org/sigcomm/sigcomm99/papers/ session7-2.html
11. Huberman, Bernardo A., and Lada A. Adamic. 1999. Growth dynamics of the World-Wide Web. Nature 401:131.http://xxx.lanl.gov/abs/cond-mat/9901071
12. Kleinberg, Jon. 1999. The small-world phenomenon: an algorithmic perspective. Cornell Computer Science Technical Report 99-1776. http://www.cs.cornell.edu/ home/kleinber/swn.ps
13. Kleinberg, Jon M., Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan and Andrew S. Tomkins. 1999. The Web as a graph: measurements, models, and methods. In Proceedings of the Fifth International Conference on Computing and Combinatorics, Tokyo July 26-28, 1999 (COCOON '99). Berlin: Springer-Verlag, pages 1-17.
14. Watts, Duncan J. 1999. Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton: Princeton University Press.
15. Watts, Duncan J., and Steven H. Strogatz. 1998. Collective dynamics of 'small-world' networks. Nature 393:440-442.