Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annual Symp. on Foundations of Computer Science, IEEE Press, New York, San Juan, Puerto Rico, October 1979, pp. 218–223.
2. G. Barnes, J.F. Buss, W.L. Ruzzo, B. Schieber, A sublinear space, polynomial time algorithm for directed s−t connectivity, in: Proc., Structure in Complexity Theory, 7th Annual Conf., IEEE Press, New York, Boston, MA, June 1992, pp. 27–33.
3. G. Barnes, J. Edmonds, Time-space lower bounds for directed s-t connectivity on JAG models, 34th Annual Symp. on Foundations of Computer Science, Palo Alto, CA, November 1993, pp. 228–237.
4. Time-space trade-offs for undirected graph connectivity;Beame;SIAM J. Comput.,1998
5. P. Berman, J. Simon, Lower bounds on graph threading by probabilistic machines, in: 24th Annual Symp. on Foundations of Computer Science, IEEE Press, New York, Tucson, AZ, November 1983, pp. 304–311.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献