Optimizing a computational method for length lower bounds for reflecting sequences
From MaRDI portal
Recommendations
- Length lower bounds for reflecting sequences and universal traversal sequences
- Lower bounds on universal traversal sequences based on chains of length five
- Lower bounds on the length of universal traversal sequences
- Universal traversal sequences for paths and cycles
- Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs
Cited in
(6)- Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)).
- Universal traversal sequences with backtracking.
- Length lower bounds for reflecting sequences and universal traversal sequences
- On minimizing the lengths of checking sequences
- Lower bounds on lengths of checking sequences
- Improved length lower bounds for reflecting sequences
This page was built for publication: Optimizing a computational method for length lower bounds for reflecting sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551362)