Universal traversal sequences for paths and cycles
Journal of Algorithms
Universal traversal sequences of length nO(log n) for cliques
Information Processing Letters
Polynomial universal traversing sequences for cycles are constructible
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Universal sequences for complete graphs
Discrete Applied Mathematics - Computational combinatiorics
Universal traversal sequences for expander graphs
Information Processing Letters
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Piecemeal Learning of an Unknown Environment
Machine Learning - Special issue on COLT '93
Lower bounds on universal traversal sequences based on chains of length five
Information and Computation
Piecemeal graph exploration by a mobile robot
Information and Computation
Exploring unknown undirected graphs
Journal of Algorithms
Exploring Unknown Environments
SIAM Journal on Computing
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Log-Space constructible universal traversal sequences for cycles of length O(n4.03)
Theoretical Computer Science - Computing and combinatorics
Tree exploration with little memory
Journal of Algorithms
Journal of Graph Theory
On the power of the compass (or, why mazes are easier to search than graphs)
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
The power of team exploration: two robots can learn unlabeled directed graphs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Information Processing Letters
Online graph exploration: new results on old and new algorithms
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Periodic data retrieval problem in rings containing a malicious host
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Online graph exploration with advice
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
| Hi-index | 0.05 |
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) influence its exploration capability? In particular, does every increase of the memory size enable an agent to explore more graphs? We give a partial answer to this problem by showing that a strict gain of the exploration power can be obtained by a polynomial increase of the number of states. We also show that, for automata with few states, the increase of memory by even one state results in the capability of exploring more graphs.