Author:
Abdullah Mohammed Amin,Cooper Colin,Draief Moez
Publisher
Springer International Publishing
Reference13 articles.
1. Abdullah, M., Cooper, C., Frieze, A.M.: Cover time of a random graph with given degree sequence. Discrete Math. 312(21), 3146–3163 (2012)
2. Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs.
http://stat-www.berkeley.edu/pub/users/aldous/RWG/book.html
3. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pp.218–223 (1979)
4. Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Comput. Complex. 6, 312–340 (1997)
5. Doyle, P.G., Snell, J.L.: Random Walks and Electrical Networks (2006)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献