Reference25 articles.
1. D. Aldous, “Lower Bounds for Covering Times for Reversible Markov Chains and Random Walks on Graphs,” Journal of Theoretical Probability, 2 (1989), 91–100.
2. R. Aleliunas, “A simple graph traversal problem,” Master thesis, University of Toronto, 1978.
3. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz and C. Rackoff, “Random walks, universal traversal sequences, and the complexity of maze problems,” Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, 1979, 218–233.
4. N. Alon, “Eigenvalues and expanders,” Combinatorica, 6 (1986), 83–96.
5. N. Alon and Y. Ravid, “Universal sequences for complete graphs,” (1987), to appear in Discrete Applied Mathematics.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New Bounds for Edge-Cover by Random Walk;Combinatorics, Probability and Computing;2014-03-11
2. The Evolution of the Cover Time;Combinatorics, Probability and Computing;2011-02-15