The following pages link to Generating Linear Extensions Fast (Q4291563):
Displaying 50 items.
- A regeneration scheme for generating extensions (Q290228) (← links)
- 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)
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Loopless generation of linear extensions of a poset (Q698444) (← links)
- Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice (Q722587) (← links)
- Generating a random linear extension of a partial order (Q805042) (← links)
- Inferring a possibility distribution from empirical data (Q812620) (← links)
- On the random generation and counting of weak order extensions of a poset with given class cardinalities (Q867611) (← links)
- Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
- Average relational distance in linear extensions of posets (Q966037) (← 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)
- Counting linear extensions (Q1183942) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- Generating linear extensions by adjacent transpositions (Q1325273) (← links)
- Weak-order extensions of an order. (Q1401400) (← links)
- The connectivity of acyclic orientation graphs (Q1584217) (← links)
- Extended boxed product and application to synchronized trees (Q1687792) (← 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)
- Posets with seven linear extensions sortable by three comparisons (Q1944901) (← links)
- Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
- A polynomial time algorithm for the 2-poset cover problem (Q2032144) (← links)
- Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures (Q2036791) (← links)
- Evolution on distributive lattices (Q2201887) (← links)
- Counting linear extensions of restricted posets (Q2215472) (← 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)
- Linear extensions of N-free orders. (Q2351714) (← links)
- Fast perfect sampling from linear extensions (Q2368931) (← 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)
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction (Q3191146) (← 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)
- Order Preserving Maps and Linear Extensions of a Finite Poset (Q3691787) (← links)
- Polynomial algorithms to count linear extensions in certain posets (Q3972873) (← links)
- Generating the Linear Extensions of Certain Posets by Transpositions (Q3992179) (← links)
- Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints (Q5001675) (← links)
- (Q5176418) (← links)
- Efficient algorithms on distributive lattices (Q5936459) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
