The following pages link to Gray codes from antimatroids (Q1318347):
Displaying 11 items.
- Efficient generation of the ideals of a poset in Gray code order. II (Q391390) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Efficient generation of the ideals of a poset in Gray code order (Q989454) (← links)
- Gray codes for column-convex polyominoes and a new class of distributive lattices (Q1044890) (← links)
- Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) (← links)
- Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
- Oracles for vertex elimination orderings (Q2566003) (← links)
- Fast Detection of Stable and Count Predicates in Parallel Computations (Q3300821) (← links)
- Efficient algorithms on distributive lattices (Q5936459) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
