Currently, exhaustive search is the only known method for nding longest induced paths in hypercubes. Based on empirical data we conjecture that extending suitable maximal, but not necessarily longest, snakes in an n-dimensional hypercube is a tractable alternative for generating longest snakes in an (n+1)-dimensional hypercube. In this paper, we present our… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.