The following pages link to Generating Linear Extensions Fast (Q4291563):
Displaying 29 items.
- Tight performance bounds in the worst-case analysis of feed-forward networks (Q312640) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- On extensions, linear extensions, upsets and downsets of ordered sets (Q556831) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Inferring a possibility distribution from empirical data (Q812620) (← links)
- Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
- A CAT algorithm for generating permutations with a fixed number of inversions (Q1007583) (← links)
- Extensions of the prudence principle to exploit a valued outranking relation (Q1038343) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- Weak-order extensions of an order. (Q1401400) (← links)
- The connectivity of acyclic orientation graphs (Q1584217) (← links)
- Gray code enumeration of families of integer partitions (Q1805052) (← links)
- Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) (← links)
- Reverse search for enumeration (Q1917258) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
- Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures (Q2036791) (← links)
- Evolution on distributive lattices (Q2201887) (← links)
- On the restricted cores and the bounded core of games on distributive lattices (Q2256340) (← links)
- Bottom-up: a new algorithm to generate random linear extensions of a poset (Q2279676) (← links)
- Oracles for vertex elimination orderings (Q2566003) (← links)
- Minimal change list for Lucas strings and some graph theoretic consequences (Q2581343) (← links)
- MINING POSETS FROM LINEAR ORDERS (Q2874042) (← links)
- Badness of Serial Fit Revisited (Q2914447) (← links)
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION (Q3434277) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- (Q5176418) (← links)
- Efficient algorithms on distributive lattices (Q5936459) (← links)
