Log-Space constructible universal traversal sequences for cycles of length O(n4.03)

Authors:
Michal Koucký
Affiliations:
Department of Computer Science, Rutgers University, Piscataway, NJ
Venue:
Theoretical Computer Science - Computing and combinatorics
Year:
2003

Citing 7
Cited 4

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
Bounds on universal sequences

SIAM Journal on Computing
Universal traversal sequences for expander graphs

Information Processing Letters
SL ⊆L4/3

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Universal Traversal Sequences with Backtracking

CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity

Graph exploration by a finite automaton

Theoretical Computer Science - Mathematical foundations of computer science 2004
Impact of memory size on graph exploration capability

Discrete Applied Mathematics
Memory Efficient Anonymous Graph Exploration

Graph-Theoretic Concepts in Computer Science
Tree exploration with logarithmic memory

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a simple construction of polynomial length universal traversal sequences for cycles. These universal traversal sequences are log-space (even NC1) constructible and are of length O(n4.03). Our result improves the previously known upper-bound O(n4.76) for log-space constructible universal traversal sequences for cycles.