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

Michal Koucký
2003 Theoretical Computer Science  
The paper presents a simple construction of polynomial length universal traversal sequences for cycles. These universal traversal sequences are log-space (even NC 1 ) constructible and are of length O(n 4:03 ). Our result improves the previously known upper-bound O(n 4:76 ) for log-space constructible universal traversal sequences for cycles.
doi:10.1016/s0304-3975(02)00436-x fatcat:ke2slamjnzh6jggdxyuefan6eu