Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science, pages 218–223. IEEE Computer Society, October 1979.
2. R. Aleliunas. A simple graph traversal problem. Department of Computer Science, University of Toronto, Technical Report 120. April 1978.
3. P. Beame, A. Borodin, P. Raghavan, W. L. Ruzzo, and M. Tompa. Timespace tradeoffs for undirected graph traversal. In Proceedings of the 31st IEEE Symposium on the Foundations of Computer Science, pages 429–438. IEEE Computer Society, October 1990.
4. A. Bar-Noy, A. Borodin, M. Karchmer, N. Linial, and M. Werman. Bounds on universal sequences. SIAM Journal on Computing, 18(2):268–277, 1989.
5. A. Borodin, W. L. Ruzzo, and M. Tompa. Lower bounds on the length of universal traversal sequences. In Proceedings of the 21st ACM Symposium on the Theory of Computing, pages 562–573. Association for Computing Machinery, May 1989.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献