Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03)
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
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
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An O(log n log log n) space algorithm for undirected st-connectivity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Undirected connectivity in log-space
Journal of the ACM (JACM)
Multiple-level grid algorithm for getting 2D road map in 3D virtual scene
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Delays induce an exponential memory gap for rendezvous in trees
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Pure topological mapping in mobile robotics
IEEE Transactions on Robotics
The reduced automata technique for graph exploration space lower bounds
Theoretical Computer Science
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Abstract: In this paper we introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the traversal sequences defined in [AKL+], but they also exhibit some new properties. In particular, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. Further, we present extremely simple constructions of polynomial length universal exploration sequences for some previously studied classes of graphs (e.g., 2-regular graphs, cliques, expanders), and we also present universal exploration sequences for trees. Our constructions beat previously known lower-bounds on the length of universal traversal sequences.