Gray codes from antimatroids
From MaRDI portal
Publication:1318347
DOI10.1007/BF01110545zbMath0790.05054MaRDI QIDQ1318347
Publication date: 22 June 1994
Published in: Order (Search for Journal in Brave)
Partial orders, general (06A06) Combinatorial aspects of matroids and geometric lattices (05B35) Total orders (06A05) Eulerian and Hamiltonian graphs (05C45)
Related Items
Generating and characterizing the perfect elimination orderings of a chordal graph ⋮ Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Efficient generation of the ideals of a poset in Gray code order. II ⋮ Enumerating \(k\)-arc-connected orientations ⋮ Binary bubble languages and cool-lex order ⋮ Efficient algorithms on distributive lattices ⋮ Efficient generation of the ideals of a poset in Gray code order ⋮ Gray codes for column-convex polyominoes and a new class of distributive lattices ⋮ Oracles for vertex elimination orderings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm to generate the ideals of a partial order
- Explicit matchings in the middle levels of the Boolean lattice
- Branchings in rooted graphs and the diameter of greedoids
- The antipodal layers problem
- Generating linear extensions of posets by transpositions
- A Gray Code for the Ideals of a Forest Poset
- Calculating bounds on reachability and connectedness in stochastic networks
- Basis graphs of greedoids and two-connectivity
- Combinatorial Gray Codes
- Listing and Counting Subtrees of a Tree
- Generating the Linear Extensions of Certain Posets by Transpositions
- Introduction to Greedoids
- Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
- Efficient generation of the binary reflected gray code and its applications
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Generating Linear Extensions Fast
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
