Loopless Gray code enumeration and the Tower of Bucharest

DOI10.1016/J.TCS.2017.11.017MaRDI QIDQ1623270zbMATH OpenOpenAlexFDO

Authors Felix Herter, Günter Rote

Publication date 23 November 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/5886/

zbMATH Keywords

enumerationGray codeloopless generationTower of Hanoi

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Algorithms on strings (68W32) Combinatorial games (91A46)

Recommendations

• Loopless Gray code enumeration and the Tower of Bucharest
• Loop-free Gray code algorithms for the set of compositions
• Gray codes, loopless algorithm and partitions
• A loopless implementation of a gray code for signed permutations
• Gray codes for necklaces and Lyndon words of arbitrary base

Cites work

• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 1222814 (Why is no real title available?)
• A constant-time algorithm for middle levels Gray codes
• Counting and enumerating crossing-free geometric graphs
• Efficient generation of the binary reflected gray code and its applications
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Loopless Gray code enumeration and the Tower of Bucharest
• On generating all maximal independent sets
• Purely Functional Data Structures
• The Tower of Hanoi -- myths and maths. With a foreword by Ian Stewart
• The Tower of Hanoi with Forbidden Moves
• The Towers of Hanoi Problem
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The design of dynamic data structures

Cited in

(2)

• Loopless Gray code enumeration and the Tower of Bucharest
• The weighted tower of Hanoi

This page was built for publication: Loopless Gray code enumeration and the Tower of Bucharest

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