Listing Combinatorial Objects
abstract: Gray codes are perhaps the best known structures for listing sequences of combinatorial objects, such as binary strings. Simply defined as a minimal change listing, Gray codes vary greatly both in structure and in the types of objects that they list. More specific types of Gray codes are u...
Other Authors: | Horan, Victoria E. (Author) |
---|---|
Format: | Doctoral Thesis |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/2286/R.I.15797 |
Similar Items
-
Universal Cycles for Some Combinatorial Objects
by: Campbell, Andre A
Published: (2013) -
Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs
by: Ruth Haas, et al.
Published: (2018-03-01) -
Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes
by: Sylvain Contassot-Vivier, et al.
Published: (2018-06-01) -
Codes de Gray généralisés à l'énumération des objets d'une structure combinatoire sous contrainte
by: Castro Trejo, Aline
Published: (2012) -
Gray code numbers of complete multipartite graphs
by: Bard, Stefan
Published: (2014)