Author:
Abdullah Mohammed,Cooper Colin,Frieze Alan
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 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. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs;Bollobás;European Journal of Combinatorics,1980
3. Complex Variables and Applications;Brown,1996
4. The cover time of random regular graphs;Cooper;SIAM Journal on Discrete Mathematics,2005
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献