Subject
General Computer Science,Theoretical Computer Science
Reference41 articles.
1. Planar and grid graph reachability problems;Allender;Theory Comput. Syst.,2009
2. Linear time algorithms for np-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
3. Computational Complexity: a Modern Approach;Arora,2009
4. Memory-constrained algorithms for shortest path problem;Asano,2011
5. Depth-first search using o(n) bits;Asano,2014