Shift gray codes

Shift gray codes

Combinatorial objects can be represented by strings, such as 21534 for the permutation (1 2) (3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1 s2 sn, the right-shift operation shift(s, i, j) replaces the substring si si+1..sj by si+1..sj s...

Full description

Bibliographic Details
Main Author: Williams, Aaron Michael
Other Authors: Ruskey, Frank
Language:English
en
Published: 2009
Subjects:
shorthand universal cycles
combinatorial generation
minimal-change order
loopless algorithm
efficient algorithm
combinations
multiset permutations
balanced parentheses
Dyck words
Catalan paths
Schroder paths
Motzkin words
linear-extensions
posets
connected unit interval graphs
inversions
binary trees
k-ary trees
ordered trees with fixed branching sequence
Lyndon words
pre-necklaces
theoretical computer science
discrete mathematics
combinatorics
brute forcs
de Bruijn cycles
bubble languages
cool-lex order
lexicographic order
combinatorial enumeration
stacker-crane problem
traveling salesman problem
middle levels
fixed-density de Bruijn cycle
fixed-content
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
UVic Subject Index::Sciences and Engineering::Mathematics
Online Access:http://hdl.handle.net/1828/1966

Internet

http://hdl.handle.net/1828/1966

Similar Items