Efficient Computation of Middle Levels Gray Codes

DOI10.1145/3170443zbMath1414.94947OpenAlexW2963283269WikidataQ129976525 ScholiaQ129976525MaRDI QIDQ4554342

Jerri Nummenpalo, Torsten Mütze

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

zbMATH Keywords

Gray codemiddle levels conjecture

Mathematics Subject Classification ID

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

Related Items (3)

Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length ⋮ A numeral system for the middle-levels graphs ⋮ A constant-time algorithm for middle levels Gray codes

This page was built for publication: Efficient Computation of Middle Levels Gray Codes