Skip to search formSkip to main contentSkip to account menu

Snake-in-the-box

Known as: Snake in the box 
The snake-in-the-box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube. This path… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Coding theoryCombinatoricaComputer scienceDiscrete mathematics

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Perfect Snake-in-the-Box Codes for Rank Modulation
For odd <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>, the alternating group on <inline-formula… 
2016
2016
On the snake-in-the-box codes for rank modulation under Kendall’s τ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage…
For exactly and efficiently representing and storing data in flash memories, the rank modulation scheme has been presented. In… 
2015
2015
Solving the Snake in the Box Problem with Heuristic Search: First Results
Snake in the Box (SIB) is the problem of finding the longest simple path along the edges of an n-dimensional cube, subject to… 
2013
2013
Constructions of Snake-in-the-Box Codes for Rank Modulation
Snake-in-the-box code is a Gray code, which is capable of detecting a single error. Gray codes are important in the context of… 
Review
2010
Review
2010
The Snake-in-the-Box problem
The Snake-in-the-Box problem finds its roots in graph theory and computer science with applications in electrical engineering… 
2006
2006
The snake in the box problem: mathematical conjecture and a genetic algorithm approach
With applications in coding theory and hypercube-based computing and networking, the "snake in the box" problem is of great… 
2005
2005
New Lower Bounds for the Snake-in-the-Box Problem: Using Evolutionary Techniques to Hunt for Snakes
The snake-in-the-box problem is a difficult problem in mathematics and computer science that was first described by Kautz in the… 
1997
1997
An upper bound on the size of the snake-in-the-box
A snake in a graph is a simple cycle without chords. We give an upper bound on the size of a snake S in then-dimensional cube of… 
1994
1994
Using the genetic algorithm to find snake-in-the-box codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the… 
1989
1989
A new lower bound for Snake-in-the-Box Codes
In this paper we give a new lower bound on the length of Snake-in-the-Box Codes, i.e., induced cycles in thed-dmensional cube… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)