Searching for "Combinatorial Gray codes." – sorted by Relevance.
-
A Survey of Combinatorial Gray Codes
- A Survey of Combinatorial Gray Codes Carla Savage Department of Computer Science North Carolina
- Cited by 48 (3 self) – Add To MetaCart
-
Simple combinatorial Gray codes constructed by reversing sublists
- 1 Simple combinatorial Gray codes constructed by reversing sublists Frank Ruskey 1 Department
- Cited by 14 (5 self) – Add To MetaCart
-
Fachbereich 3
- of research. A simple but important observation is the fact that a combinatorial Gray code can be seen as a
- Add To MetaCart
-
Gray Code Enumeration of Families of Integer Partitions
- are called minimal change algorithms or combinatorial Gray codes, in honor of the reflected binary code
- Cited by 2 (2 self) – Add To MetaCart
-
Loopless Generation of Schröder Trees
- trees, Korsh et al. [6]. A combinatorial Gray code is a listing of combinatorial objects in which only a
- Add To MetaCart
-
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal
- general framework of combinatorial Gray code, many of which are based on a recursive algorithm, causing O
- Cited by 5 (1 self) – Add To MetaCart
-
Gray Codes from Antimatroids
- . Keywords: Antimatroid, basic word graph, combinatorial Gray code, Hamiltonicity, joindistributive lattice
- Cited by 1 (1 self) – Add To MetaCart
-
Generating Linear Extensions Fast
- words. Poset, linear extension, transposition, combinatorial Gray code AMS subject classifications. 05C
- Cited by 24 (5 self) – Add To MetaCart
-
Algorithms for the Multiobjective Traveling Salesman Problem
- combinatorial Gray code for this task, which can be generated by the Gray code for compositions [28]. Finally
- Add To MetaCart
-
An O(1) Time Algorithm for Generating Multiset Permutations
- with O(1) changes is named ”combinatorial Gray codes”, and a good survey is given in [11]. In many cases
- Cited by 1 (0 self) – Add To MetaCart

