Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference4 articles.
1. Random walks, universal traversal sequences, and the complexity of maze problems;Aleliunas,1979
2. Random Graphs;Bollobás,1986
3. Space-bounded reducibility among combinatorial problems;Jones;J. Comput. System Sci.,1975
4. New problems complete for nondeterministic log space;Jones;Math. Systems Theory,1976
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tree exploration with logarithmic memory;ACM Transactions on Algorithms;2011-03
2. The Evolution of the Cover Time;Combinatorics, Probability and Computing;2011-02-15
3. Impact of memory size on graph exploration capability;Discrete Applied Mathematics;2008-06
4. Memory Efficient Anonymous Graph Exploration;Graph-Theoretic Concepts in Computer Science;2008
5. Graph exploration by a finite automaton;Theoretical Computer Science;2005-11