Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Undirected connectivity in log-space;Reingold;J. ACM,2008
2. Relationships between nondeterministic and deterministic tape complexities;Savitch;J. Comput. Syst. Sci.,1970
3. The complexity of graph connectivity;Wigderson,1992
4. A sublinear space, polynomial time algorithm for directed s-t connectivity;Barnes;SIAM J. Comput.,1998
5. Memory-constrained algorithms for shortest path problem;Asano,2011