Sciweavers

Share
GEM
2007

Searching for Snake-In-The-Box Codes With Evolved Pruning Models

10 years 1 months ago
Searching for Snake-In-The-Box Codes With Evolved Pruning Models
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evolutionary algorithm. These snakes are then analyzed to define a pruning model that constrains the search space. A depth-first search of the constrained solution space has established new lower bounds for the length of the longest snakes in the 9 and 10 dimensional hypercube graphs.
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where GEM
Authors Daniel R. Tuohy, Walter D. Potter, Darren A. Casella
Comments (0)
books