Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, 1979, pp. 218–223
2. Emergence of scaling in random networks;Barabási;Science,1999
3. The diameter of a scale-free random graph;Bollobás;Combinatorica,2004
4. The degree sequence of a scale-free random graph process;Bollobás;Random Structures Algorithms,2001
5. Complex Variables and Applications;Brown,1996
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献