The Greedy Gray Code Algorithm
From MaRDI portal
Publication:2842188
DOI10.1007/978-3-642-40104-6_46zbMath1390.68753OpenAlexW133997040WikidataQ64148822 ScholiaQ64148822MaRDI QIDQ2842188
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40104-6_46
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Algorithms on strings (68W32)
Related Items (13)
Greedy flipping of pancakes and burnt pancakes ⋮ Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes ⋮ Greedy cycles in the star graphs ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Star transposition Gray codes for multiset permutations ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality ⋮ A pivot Gray code listing for the spanning trees of the fan graph ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ A Hamilton cycle in the \(k\)-sided pancake network
This page was built for publication: The Greedy Gray Code Algorithm
