Linear time construction of a compressed Gray code

DOI10.1016/j.ejc.2012.07.015zbMath1261.94038OpenAlexW2095365078WikidataQ60692176 ScholiaQ60692176MaRDI QIDQ1761499

Darko Dimitrov, Riste Škrekovski, Tomáš Dvořák, Petr Gregor

Publication date: 15 November 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.015

zbMATH Keywords

Gray codegenerating algorithmgraph of transitions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Unnamed Item ⋮ Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution ⋮ Gray codes and symmetric chains

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• A construction of Gray codes inducing complete graphs
• Graphs induced by Gray codes
• Transition restricted Gray codes
• Gray Code Compression
• A Survey of Combinatorial Gray Codes
• Optimal Assignments of Numbers to Vertices
• Research problems

This page was built for publication: Linear time construction of a compressed Gray code