scientific article; zbMATH DE number 2040940
From MaRDI portal
Publication:4452089
zbMATH Open1038.68566MaRDI QIDQ4452089FDOQ4452089
Author name not available (Why is that?)
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2731/27310073.htm
Title of this publication is not available (Why is that?)
Cited In (22)
- Binary bubble languages and cool-lex order
- A general exhaustive generation algorithm for Gray structures
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- Flip-swap languages in binary reflected Gray code order
- More restrictive Gray codes for necklaces and Lyndon words
- Title not available (Why is that?)
- Restricted compositions and permutations: from old to new Gray codes
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
- Gray codes for signed involutions
- Traversing combinatorial 0/1-polytopes via optimization
- Minimal change list for Lucas strings and some graph theoretic consequences
- Prefix partitioned Gray codes for particular cross-bifix-free sets
- Gray code orders for \(q\)-ary words avoiding a given factor
- Gray coding cubic planar maps
- Gray visiting Motzkins
- Efficient generation of restricted growth words
- The coolest way to generate combinations
- Gray code for permutations with a fixed number of cycles
- Strings from linear recurrences and permutations: a gray code
- Generalized algorithm for restricted weak composition generation
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
- Gray codes for involutions
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452089)
