Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Reference10 articles.
1. , , , , 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. Random graphs, 2nd ed., Cambridge University Press, Cambridge, 2001.
3. An algorithm for finding hamilton paths and cycles in random graphs
4. Bounds on the cover time
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献