Gray codes with bounded weights
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10099485" target="_blank" >RIV/00216208:11320/12:10099485 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0012365X11004481" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0012365X11004481</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2011.09.034" target="_blank" >10.1016/j.disc.2011.09.034</a>
Alternative languages
Result language
angličtina
Original language name
Gray codes with bounded weights
Original language description
Given a set H of binary vectors of length n, is there a listing of H so that every two successive vectors differ in a single coordinate? The problem of the existence of such a listing, which is called a Gray code of H, is known to be NP-complete in general. The goal of this paper is to specify boundaries between its intractability and polynomial decidability in terms of weights of vectors in H.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
312
Issue of the periodical within the volume
17
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
13
Pages from-to
2599-2611
UT code for WoS article
000306873100013
EID of the result in the Scopus database
—