Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)).

DOI10.1016/S0304-3975(02)00436-XzbMath1044.68128MaRDI QIDQ1401264

Michal Koucký

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Memory Efficient Anonymous Graph Exploration ⋮ Length lower bounds for reflecting sequences and universal traversal sequences ⋮ Impact of memory size on graph exploration capability ⋮ Graph exploration by a finite automaton

Cites Work

• Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
• Pseudorandom generators for space-bounded computation
• Universal traversal sequences for expander graphs
• Bounds on Universal Sequences
• Universal traversal sequences for paths and cycles
• Unnamed Item
• Unnamed Item

This page was built for publication: Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)).