Efficient computation of middle levels Gray codes

DOI10.1145/3170443zbMATH Open1414.94947OpenAlexW2963283269WikidataQ129976525 ScholiaQ129976525MaRDI QIDQ4554342FDOQ4554342

Authors: Torsten Mütze, Jerri Nummenpalo 

Publication date: 13 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/118879/3/WRAP-efficient-computation-middle-levels-Gray-codes-Mutze-2018.pdf

Recommendations

• Efficient Computation of Middle Levels Gray Codes
• A constant-time algorithm for middle levels Gray codes
• A constant-time algorithm for middle levels Gray codes
• Monotone Gray codes and the middle levels problem
• Linear time construction of a compressed Gray code

zbMATH Keywords

Gray codemiddle levels conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial codes (94B25)

Cited In (6)

• On a combinatorial generation problem of Knuth
• Efficient Computation of Middle Levels Gray Codes
• A constant-time algorithm for middle levels Gray codes
• A numeral system for the middle-levels graphs
• A constant-time algorithm for middle levels Gray codes
• Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length

This page was built for publication: Efficient computation of middle levels Gray codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554342)