The following pages link to Lengths of snakes in boxes (Q5533021):
Displaying 12 items.
- A new upper bound for the length of snakes (Q1061716) (← links)
- Snakes and pseudo-snakes in powers of complete graphs (Q1096640) (← links)
- On the snake in the box problem (Q1113920) (← links)
- A new lower bound for snake-in-the-box codes (Q1120544) (← links)
- The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions (Q1121245) (← links)
- Local optimization on graphs (Q1122503) (← links)
- Further results on snakes in powers of complete graphs (Q1182573) (← links)
- An upper bound on the size of the snake-in-the-box (Q1382411) (← links)
- Isomorphism of maximum length circuit codes (Q2119935) (← links)
- Maximal length of circuit in a unitary \(n\)-dimensional cube (Q2546193) (← links)
- k-Pseudosnakes in n-dimensional Hypercubes (Q3439159) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
