Author:
Lu Pinyan,Zhang Jialin,Poon Chung Keung,Cai Jin-Yi
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1979, pp. 218–223. IEEE, Los Alamitos (1979)
2. Alon, N., Roichman, Y.: Random Cayley graphs and and expanders. Random Structures and Algorithms 5(2), 271–284 (1994)
3. Armoni, R., Ta-Shma, A., Wigderson, A., Zhou, S.: An O(log(n)4/3) space algorithm for (s,t) connectivity in undirected graphs. Journal of the ACM 47(2), 294–311 (2000)
4. Barnes, G., Buss, J.F., Ruzzo, W.L., Schieber, B.: A sublinear space, polynomial time algorithm for directed s-t connectivity. SIAM Journal on Computing 27(5), 1273–1282 (1998)
5. Berman, P., Simon, J.: Lower bounds on graph threading by probabilistic machines. In: 24th Annual Symposium on Foundations of Computer Science, Tucson, AZ, November 1983, pp. 304–311. IEEE, Los Alamitos (1983)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献