Log-space constructible universal traversal sequences for cycles of length O(n4.03) |
| |
Affiliation: | Department of Computer Science, Rutgers University, Piscataway, NJ 08854, USA |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|