A heuristic approach for constructing symmetric Gray codes (Q1883151): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound associated with errors in Gray code (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray codes for partial match and range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the theory of hypercube graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-track Gray codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Complete Cycles on the n-Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of single-track Gray codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for Generating Specialized Gray Codes / rank
 
Normal rank

Latest revision as of 12:13, 7 June 2024

scientific article
Language Label Description Also known as
English
A heuristic approach for constructing symmetric Gray codes
scientific article

    Statements

    A heuristic approach for constructing symmetric Gray codes (English)
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    Hamiltonian paths on hypercubes
    0 references
    Gray coordinate lattice
    0 references
    Hamiltonian cycles
    0 references

    Identifiers