Generating Linear Extensions Fast
From MaRDI portal
Recommendations
- Faster random generation of linear extensions
- Optimizing linear extensions
- Fundamentals of Computation Theory
- Fast linearly independent arithmetic expansions
- Generating linear extensions by adjacent transpositions
- Fast perfect sampling from linear extensions
- Approximating the number of linear extensions
- Counting linear extensions
- Generating a \(d\)-dimensional linear subspace efficiently
- A faster tree-decomposition based algorithm for counting linear extensions
Cited in
(60)- Minimizing the sum cost in linear extensions of a poset
- Applying relation algebra and RelView to solve problems on orders and lattices
- Enumerating models of DNF faster: breaking the dependency on the formula size
- A loop-free algorithm for generating the linear extensions of a poset
- Generating the Linear Extensions of Certain Posets by Transpositions
- Characterizing traces of processes defined by precedence and response constraints: an order theory approach
- Binary bubble languages and cool-lex order
- Average relational distance in linear extensions of posets
- Gray code enumeration of families of integer partitions
- Extensions of the prudence principle to exploit a valued outranking relation
- scientific article; zbMATH DE number 2011851 (Why is no real title available?)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- On extensions, linear extensions, upsets and downsets of ordered sets
- Gray codes from antimatroids
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Badness of Serial Fit Revisited
- Order Preserving Maps and Linear Extensions of a Finite Poset
- A regeneration scheme for generating extensions
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
- Entropic uniform sampling of linear extensions in series-parallel posets
- A combinatorial study of async/await processes
- Counting linear extensions
- Linear extensions of N-free orders.
- Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures
- Fast perfect sampling from linear extensions
- Linear extensions of diamond posets
- Inferring a possibility distribution from empirical data
- Combinatorial generation via permutation languages. IV: Elimination trees
- scientific article; zbMATH DE number 16221 (Why is no real title available?)
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
- Faster random generation of linear extensions
- A polynomial time algorithm for the 2-poset cover problem
- Counting linear extensions of restricted posets
- Weak-order extensions of an order.
- Tight performance bounds in the worst-case analysis of feed-forward networks
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- Minimal change list for Lucas strings and some graph theoretic consequences
- A CAT algorithm for generating permutations with a fixed number of inversions
- Family Trees for Enumeration
- On the restricted cores and the bounded core of games on distributive lattices
- Reverse search for enumeration
- Mining posets from linear orders.
- Computing linear extensions for polynomial posets subject to algebraic constraints
- Algorithms over partially ordered sets
- scientific article; zbMATH DE number 2011835 (Why is no real title available?)
- Evolution on distributive lattices
- A loopless algorithm for generation of basic minimal interval orders
- Posets with seven linear extensions sortable by three comparisons
- Loopless generation of linear extensions of a poset
- Extended boxed product and application to synchronized trees
- Oracles for vertex elimination orderings
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- Cycle-free cuts of mutual rank probability relations.
- Fundamentals of Computation Theory
- Number of linear extensions for a variant of up-down poset
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Efficient algorithms on distributive lattices
- The connectivity of acyclic orientation graphs
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction
This page was built for publication: Generating Linear Extensions Fast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291563)
