Gray codes from antimatroids
From MaRDI portal
Recommendations
- Gray codes for AT-free orders via antimatroids
- On the \((n,t)\)-antipodal Gray codes
- Antipodal Gray codes
- Affine m-ary gray codes
- scientific article; zbMATH DE number 3409221
- On m-ary Gray codes
- Gray codes and symmetric chains
- Gray codes and symmetric chains
- Codes and anticodes in the Grassman graph
- scientific article; zbMATH DE number 706769
Cites work
- scientific article; zbMATH DE number 3648418 (Why is no real title available?)
- scientific article; zbMATH DE number 4137767 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- A Gray Code for the Ideals of a Forest Poset
- An algorithm to generate the ideals of a partial order
- Basis graphs of greedoids and two-connectivity
- Branchings in rooted graphs and the diameter of greedoids
- Calculating bounds on reachability and connectedness in stochastic networks
- Combinatorial Gray Codes
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Efficient generation of the binary reflected gray code and its applications
- Explicit matchings in the middle levels of the Boolean lattice
- Generating Linear Extensions Fast
- Generating linear extensions of posets by transpositions
- Generating the Linear Extensions of Certain Posets by Transpositions
- Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
- Introduction to Greedoids
- Listing and Counting Subtrees of a Tree
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- The antipodal layers problem
Cited in
(15)- Efficient generation of the ideals of a poset in Gray code order. II
- Enumerating \(k\)-arc-connected orientations
- Efficient generation of the ideals of a poset in Gray code order
- Traversing combinatorial 0/1-polytopes via optimization
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Fast Detection of Stable and Count Predicates in Parallel Computations
- Canonical form of Gray codes in \(N\)-cubes
- scientific article; zbMATH DE number 5761830 (Why is no real title available?)
- Gray codes for column-convex polyominoes and a new class of distributive lattices
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Efficient algorithms on distributive lattices
- Gray codes for AT-free orders via antimatroids
- Binary bubble languages and cool-lex order
- Oracles for vertex elimination orderings
- Codes and anticodes in the Grassman graph
This page was built for publication: Gray codes from antimatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318347)
